{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QI5JFTMKE6DAH63YYP4RF5PV7O","short_pith_number":"pith:QI5JFTMK","schema_version":"1.0","canonical_sha256":"823a92cd8a278603fb78c3f912f5f5fb9f5e10a9bc2ad2143a971c7aba8296c3","source":{"kind":"arxiv","id":"2201.04799","version":2},"attestation_state":"computed","paper":{"title":"Finding $(s,d)$-Hypernetworks in F-Hypergraphs is NP-Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Lo\\\"ic Miller, Max Ward, Reynaldo Gil-Pons","submitted_at":"2022-01-13T05:38:13Z","abstract_excerpt":"We consider the problem of computing an $(s,d)$-hypernetwork in an acyclic F-hypergraph. This is a fundamental computational problem arising in directed hypergraphs, and is a foundational step in tackling problems of reachability and redundancy. This problem was previously explored in the context of general directed hypergraphs (containing cycles), where it is NP-hard, and acyclic B-hypergraphs, where a linear time algorithm can be achieved. In a surprising contrast, we find that for acyclic F-hypergraphs the problem is NP-hard, which also implies the problem is hard in BF-hypergraphs. This is"},"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":"2201.04799","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2022-01-13T05:38:13Z","cross_cats_sorted":[],"title_canon_sha256":"26e7a7883cf4b5225af70287c5b9b2c85be45f932754ff7d3c12ace66897397d","abstract_canon_sha256":"07b4e4bea7403b3d8e022d7432cd92d7bfe0efe20174106e91b954ee9efcd2d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:20.514015Z","signature_b64":"ObKI3bQNXxtYmokqsOW2ASFq5D9kgCJ0nqyMAtTnWvj/PpHlzUZQRzmxBlV6QHe1CvlhVXZybeTkEkgfkYKsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"823a92cd8a278603fb78c3f912f5f5fb9f5e10a9bc2ad2143a971c7aba8296c3","last_reissued_at":"2026-07-05T03:48:20.513617Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:20.513617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding $(s,d)$-Hypernetworks in F-Hypergraphs is NP-Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Lo\\\"ic Miller, Max Ward, Reynaldo Gil-Pons","submitted_at":"2022-01-13T05:38:13Z","abstract_excerpt":"We consider the problem of computing an $(s,d)$-hypernetwork in an acyclic F-hypergraph. This is a fundamental computational problem arising in directed hypergraphs, and is a foundational step in tackling problems of reachability and redundancy. This problem was previously explored in the context of general directed hypergraphs (containing cycles), where it is NP-hard, and acyclic B-hypergraphs, where a linear time algorithm can be achieved. In a surprising contrast, we find that for acyclic F-hypergraphs the problem is NP-hard, which also implies the problem is hard in BF-hypergraphs. This is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.04799","kind":"arxiv","version":2},"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/2201.04799/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":"2201.04799","created_at":"2026-07-05T03:48:20.513675+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.04799v2","created_at":"2026-07-05T03:48:20.513675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.04799","created_at":"2026-07-05T03:48:20.513675+00:00"},{"alias_kind":"pith_short_12","alias_value":"QI5JFTMKE6DA","created_at":"2026-07-05T03:48:20.513675+00:00"},{"alias_kind":"pith_short_16","alias_value":"QI5JFTMKE6DAH63Y","created_at":"2026-07-05T03:48:20.513675+00:00"},{"alias_kind":"pith_short_8","alias_value":"QI5JFTMK","created_at":"2026-07-05T03:48:20.513675+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/QI5JFTMKE6DAH63YYP4RF5PV7O","json":"https://pith.science/pith/QI5JFTMKE6DAH63YYP4RF5PV7O.json","graph_json":"https://pith.science/api/pith-number/QI5JFTMKE6DAH63YYP4RF5PV7O/graph.json","events_json":"https://pith.science/api/pith-number/QI5JFTMKE6DAH63YYP4RF5PV7O/events.json","paper":"https://pith.science/paper/QI5JFTMK"},"agent_actions":{"view_html":"https://pith.science/pith/QI5JFTMKE6DAH63YYP4RF5PV7O","download_json":"https://pith.science/pith/QI5JFTMKE6DAH63YYP4RF5PV7O.json","view_paper":"https://pith.science/paper/QI5JFTMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.04799&json=true","fetch_graph":"https://pith.science/api/pith-number/QI5JFTMKE6DAH63YYP4RF5PV7O/graph.json","fetch_events":"https://pith.science/api/pith-number/QI5JFTMKE6DAH63YYP4RF5PV7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QI5JFTMKE6DAH63YYP4RF5PV7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QI5JFTMKE6DAH63YYP4RF5PV7O/action/storage_attestation","attest_author":"https://pith.science/pith/QI5JFTMKE6DAH63YYP4RF5PV7O/action/author_attestation","sign_citation":"https://pith.science/pith/QI5JFTMKE6DAH63YYP4RF5PV7O/action/citation_signature","submit_replication":"https://pith.science/pith/QI5JFTMKE6DAH63YYP4RF5PV7O/action/replication_record"}},"created_at":"2026-07-05T03:48:20.513675+00:00","updated_at":"2026-07-05T03:48:20.513675+00:00"}