{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:W2PQCT4A2B363ZLXLJ4SRNFWRG","short_pith_number":"pith:W2PQCT4A","schema_version":"1.0","canonical_sha256":"b69f014f80d077ede5775a7928b4b689a466eb34f51a20ab23cbb0b36bac4b17","source":{"kind":"arxiv","id":"2507.07528","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Kazuhiro Kurita, Kevin Mann","submitted_at":"2025-07-10T08:24:39Z","abstract_excerpt":"In this paper, we address the enumeration of (induced) $s$-$t$ paths and minimal $s$-$t$ separators. These problems are some of the most famous classical enumeration problems that can be solved in polynomial delay by simple backtracking for a (un)directed graph. As a generalization of these problems, we consider the (induced) $s$-$t$ hyperpath and minimal $s$-$t$ separator enumeration in a \\emph{directed hypergraph}. We show that extending these classical enumeration problems to directed hypergraphs drastically changes their complexity. More precisely, there are no output-polynomial time algor"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2507.07528","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-10T08:24:39Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"eca70e85f7adf12b4c846d8103426bb87ab08d5cff1adcfdde7f28b74e2e11fc","abstract_canon_sha256":"6bd0874ff89f16ac7339fa253024e5b2502437b4a70b6ff3a120ec17db2a7f36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:59.992161Z","signature_b64":"pQXW2WWq3RdRp9ChK5hIWPz7thAmJYXeD0bPhZtaTu4nIlsp1p1qiW84OUA6s9QoK3ezpH7CsPvlzEOsIiZDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b69f014f80d077ede5775a7928b4b689a466eb34f51a20ab23cbb0b36bac4b17","last_reissued_at":"2026-07-05T11:34:59.991683Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:59.991683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Kazuhiro Kurita, Kevin Mann","submitted_at":"2025-07-10T08:24:39Z","abstract_excerpt":"In this paper, we address the enumeration of (induced) $s$-$t$ paths and minimal $s$-$t$ separators. These problems are some of the most famous classical enumeration problems that can be solved in polynomial delay by simple backtracking for a (un)directed graph. As a generalization of these problems, we consider the (induced) $s$-$t$ hyperpath and minimal $s$-$t$ separator enumeration in a \\emph{directed hypergraph}. We show that extending these classical enumeration problems to directed hypergraphs drastically changes their complexity. More precisely, there are no output-polynomial time algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.07528","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.07528/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.07528","created_at":"2026-07-05T11:34:59.991740+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.07528v1","created_at":"2026-07-05T11:34:59.991740+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.07528","created_at":"2026-07-05T11:34:59.991740+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2PQCT4A2B36","created_at":"2026-07-05T11:34:59.991740+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2PQCT4A2B363ZLX","created_at":"2026-07-05T11:34:59.991740+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2PQCT4A","created_at":"2026-07-05T11:34:59.991740+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W2PQCT4A2B363ZLXLJ4SRNFWRG","json":"https://pith.science/pith/W2PQCT4A2B363ZLXLJ4SRNFWRG.json","graph_json":"https://pith.science/api/pith-number/W2PQCT4A2B363ZLXLJ4SRNFWRG/graph.json","events_json":"https://pith.science/api/pith-number/W2PQCT4A2B363ZLXLJ4SRNFWRG/events.json","paper":"https://pith.science/paper/W2PQCT4A"},"agent_actions":{"view_html":"https://pith.science/pith/W2PQCT4A2B363ZLXLJ4SRNFWRG","download_json":"https://pith.science/pith/W2PQCT4A2B363ZLXLJ4SRNFWRG.json","view_paper":"https://pith.science/paper/W2PQCT4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.07528&json=true","fetch_graph":"https://pith.science/api/pith-number/W2PQCT4A2B363ZLXLJ4SRNFWRG/graph.json","fetch_events":"https://pith.science/api/pith-number/W2PQCT4A2B363ZLXLJ4SRNFWRG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2PQCT4A2B363ZLXLJ4SRNFWRG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2PQCT4A2B363ZLXLJ4SRNFWRG/action/storage_attestation","attest_author":"https://pith.science/pith/W2PQCT4A2B363ZLXLJ4SRNFWRG/action/author_attestation","sign_citation":"https://pith.science/pith/W2PQCT4A2B363ZLXLJ4SRNFWRG/action/citation_signature","submit_replication":"https://pith.science/pith/W2PQCT4A2B363ZLXLJ4SRNFWRG/action/replication_record"}},"created_at":"2026-07-05T11:34:59.991740+00:00","updated_at":"2026-07-05T11:34:59.991740+00:00"}