{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:W2PQCT4A2B363ZLXLJ4SRNFWRG","short_pith_number":"pith:W2PQCT4A","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"},"canonical_sha256":"b69f014f80d077ede5775a7928b4b689a466eb34f51a20ab23cbb0b36bac4b17","source":{"kind":"arxiv","id":"2507.07528","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.07528","created_at":"2026-07-05T11:34:59Z"},{"alias_kind":"arxiv_version","alias_value":"2507.07528v1","created_at":"2026-07-05T11:34:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.07528","created_at":"2026-07-05T11:34:59Z"},{"alias_kind":"pith_short_12","alias_value":"W2PQCT4A2B36","created_at":"2026-07-05T11:34:59Z"},{"alias_kind":"pith_short_16","alias_value":"W2PQCT4A2B363ZLX","created_at":"2026-07-05T11:34:59Z"},{"alias_kind":"pith_short_8","alias_value":"W2PQCT4A","created_at":"2026-07-05T11:34:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:W2PQCT4A2B363ZLXLJ4SRNFWRG","target":"record","payload":{"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"},"canonical_sha256":"b69f014f80d077ede5775a7928b4b689a466eb34f51a20ab23cbb0b36bac4b17","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"},"source_kind":"arxiv","source_id":"2507.07528","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:34:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hNFgt/tCN3tgoUJ/gFKdS1iwvfUAulUfyUGcNTbsRGvt7M4zfuw2ONe0t/zA/vLrGJfUIW3qV5sSfxuEhRrgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T15:20:22.888810Z"},"content_sha256":"1f7520730a16f4f206641304d81be280e2a69380064e8e4d95de7bbadd99545e","schema_version":"1.0","event_id":"sha256:1f7520730a16f4f206641304d81be280e2a69380064e8e4d95de7bbadd99545e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:W2PQCT4A2B363ZLXLJ4SRNFWRG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:34:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EjyEj2AnjD4x/5UP8vPE6Fi3T1s/UVfzY60eIr/yEkOu2RuDOp8rb3y6IEYSRaSr8d5UA5Tj+yFqBLsDHV3dAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T15:20:22.889309Z"},"content_sha256":"15a0f8d3a36ba6c867e8739ad1197073ac993066af29dca42bae5b952afba2a8","schema_version":"1.0","event_id":"sha256:15a0f8d3a36ba6c867e8739ad1197073ac993066af29dca42bae5b952afba2a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W2PQCT4A2B363ZLXLJ4SRNFWRG/bundle.json","state_url":"https://pith.science/pith/W2PQCT4A2B363ZLXLJ4SRNFWRG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W2PQCT4A2B363ZLXLJ4SRNFWRG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T15:20:22Z","links":{"resolver":"https://pith.science/pith/W2PQCT4A2B363ZLXLJ4SRNFWRG","bundle":"https://pith.science/pith/W2PQCT4A2B363ZLXLJ4SRNFWRG/bundle.json","state":"https://pith.science/pith/W2PQCT4A2B363ZLXLJ4SRNFWRG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W2PQCT4A2B363ZLXLJ4SRNFWRG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:W2PQCT4A2B363ZLXLJ4SRNFWRG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6bd0874ff89f16ac7339fa253024e5b2502437b4a70b6ff3a120ec17db2a7f36","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-10T08:24:39Z","title_canon_sha256":"eca70e85f7adf12b4c846d8103426bb87ab08d5cff1adcfdde7f28b74e2e11fc"},"schema_version":"1.0","source":{"id":"2507.07528","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.07528","created_at":"2026-07-05T11:34:59Z"},{"alias_kind":"arxiv_version","alias_value":"2507.07528v1","created_at":"2026-07-05T11:34:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.07528","created_at":"2026-07-05T11:34:59Z"},{"alias_kind":"pith_short_12","alias_value":"W2PQCT4A2B36","created_at":"2026-07-05T11:34:59Z"},{"alias_kind":"pith_short_16","alias_value":"W2PQCT4A2B363ZLX","created_at":"2026-07-05T11:34:59Z"},{"alias_kind":"pith_short_8","alias_value":"W2PQCT4A","created_at":"2026-07-05T11:34:59Z"}],"graph_snapshots":[{"event_id":"sha256:15a0f8d3a36ba6c867e8739ad1197073ac993066af29dca42bae5b952afba2a8","target":"graph","created_at":"2026-07-05T11:34:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.07528/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Kazuhiro Kurita, Kevin Mann","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.07528","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1f7520730a16f4f206641304d81be280e2a69380064e8e4d95de7bbadd99545e","target":"record","created_at":"2026-07-05T11:34:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6bd0874ff89f16ac7339fa253024e5b2502437b4a70b6ff3a120ec17db2a7f36","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-10T08:24:39Z","title_canon_sha256":"eca70e85f7adf12b4c846d8103426bb87ab08d5cff1adcfdde7f28b74e2e11fc"},"schema_version":"1.0","source":{"id":"2507.07528","kind":"arxiv","version":1}},"canonical_sha256":"b69f014f80d077ede5775a7928b4b689a466eb34f51a20ab23cbb0b36bac4b17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b69f014f80d077ede5775a7928b4b689a466eb34f51a20ab23cbb0b36bac4b17","first_computed_at":"2026-07-05T11:34:59.991683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:34:59.991683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pQXW2WWq3RdRp9ChK5hIWPz7thAmJYXeD0bPhZtaTu4nIlsp1p1qiW84OUA6s9QoK3ezpH7CsPvlzEOsIiZDBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:34:59.992161Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.07528","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f7520730a16f4f206641304d81be280e2a69380064e8e4d95de7bbadd99545e","sha256:15a0f8d3a36ba6c867e8739ad1197073ac993066af29dca42bae5b952afba2a8"],"state_sha256":"a291ade11fd8d0b27de1c39fd41c63e453e72ea1808ba13ba7c791f2776ee91d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0Q38gOBgrD0PAqXaEKPiB12xtUwO2K49CroULqMbJG/LFkc8BOYJ/Mw16a9wQDxALifmxfDDEWcTlg7mP4cBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T15:20:22.893393Z","bundle_sha256":"e5f83b44156346679ee9cfc39a334b9ab34fdb89fe4d68a82e73780ea3fe78f6"}}