Skip to main content
Search

Hasso Plattner Institute

2 related articles

Subscribe to updates
  1. arXiv

    Planar-graph teaching needs just 2 examples: the old bound was 5, and telling 1 from 2 stays NP-hard

    For concept classes of closed neighborhoods in planar graphs, the non-clashing teaching dimension is now bounded by 2, and by 4 in the positive-only variant, with both bounds tight; the previous bounds were 5 and 7. The proof confirms the conjectured inequality between teaching dimension and VC dimension for this family, yet deciding whether either dimension is at most 1 remains NP-complete, and distinguishing the values 1 and 2 remains NP-hard.

  2. arXiv

    pm4aa mined eight roles from eight years of Commitizen repository logs and generated five executable AI agents, with smoke tests routing correctly but autonomy scoring lowest in the user study

    The work presents pm4aa, a pipeline that extracts object-centric event logs from GitHub repositories via PyStack't, maps commits to SE tasks with a Conventional Commits regular expression, partitions 589 users into eight roles with a priority-ordered rule classifier, applies object-centric, imperative (BPMN), and declarative (DECLARE) process mining per role, has an LLM generate process descriptions, and synthesizes a LangGraph multi-agent application through IBM BOB; on the Commitizen project (November 2017 to November 2025, 21,488 events, 4,813 objects) it produced five role agents, three smoke tests routed correctly, and a ten-participant user study rated knowledge schema, operational clarity, and human engagement at a median of 4, accountability at 3, and autonomy at only 2.

You’re all caught up