{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CJSBZHIBTFSMVAHCR6XHDZTW5B","short_pith_number":"pith:CJSBZHIB","canonical_record":{"source":{"id":"1504.07753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-29T08:08:39Z","cross_cats_sorted":["cs.LO","math.CO"],"title_canon_sha256":"563b4694c3a98635b5f7e1cef5013732cc65480a5716a54a4cdd9b0f5a58bb8c","abstract_canon_sha256":"95dd8fbb542079baf5447e1ad442f5e46676af69ade9a57514d5bc703b957a80"},"schema_version":"1.0"},"canonical_sha256":"12641c9d019964ca80e28fae71e676e8439f5141b7347663490a6ebaa89734ca","source":{"kind":"arxiv","id":"1504.07753","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07753","created_at":"2026-05-18T02:17:32Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07753v1","created_at":"2026-05-18T02:17:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07753","created_at":"2026-05-18T02:17:32Z"},{"alias_kind":"pith_short_12","alias_value":"CJSBZHIBTFSM","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CJSBZHIBTFSMVAHC","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CJSBZHIB","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CJSBZHIBTFSMVAHCR6XHDZTW5B","target":"record","payload":{"canonical_record":{"source":{"id":"1504.07753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-29T08:08:39Z","cross_cats_sorted":["cs.LO","math.CO"],"title_canon_sha256":"563b4694c3a98635b5f7e1cef5013732cc65480a5716a54a4cdd9b0f5a58bb8c","abstract_canon_sha256":"95dd8fbb542079baf5447e1ad442f5e46676af69ade9a57514d5bc703b957a80"},"schema_version":"1.0"},"canonical_sha256":"12641c9d019964ca80e28fae71e676e8439f5141b7347663490a6ebaa89734ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:32.344554Z","signature_b64":"77WMp/UZyPm25SDouB1uTnFklPbhLEeX8/4Jptu1noG/Bac994Qxgn46CPDrK/CKrQ6ywi8EL5uBuzlSsypTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12641c9d019964ca80e28fae71e676e8439f5141b7347663490a6ebaa89734ca","last_reissued_at":"2026-05-18T02:17:32.343807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:32.343807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.07753","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-05-18T02:17:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YZBR9WGz32K6oQG0rMgBff+eLdIQ1k/zSwHRMTZXe5qlcdZUXuMbjLpdMi0gIzKBggi1ee7NnC0Af3uSSnTlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:03:55.422088Z"},"content_sha256":"bc933db17dfea5804226d9387f3da3456ffe00abb2519df29e94e77b2a4d9c0e","schema_version":"1.0","event_id":"sha256:bc933db17dfea5804226d9387f3da3456ffe00abb2519df29e94e77b2a4d9c0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CJSBZHIBTFSMVAHCR6XHDZTW5B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hydras: Directed Hypergraphs and Horn Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.CO"],"primary_cat":"cs.DM","authors_text":"Despina Stasi, Gyorgy Turan, Robert H. Sloan","submitted_at":"2015-04-29T08:08:39Z","abstract_excerpt":"We introduce a new graph parameter, the hydra number, arising from the minimization problem for Horn formulas in propositional logic. The hydra number of a graph $G=(V,E)$ is the minimal number of hyperarcs of the form $u,v\\rightarrow w$ required in a directed hypergraph $H=(V,F)$, such that for every pair $(u, v)$, the set of vertices reachable in $H$ from $\\{u, v\\}$ is the entire vertex set $V$ if $(u, v) \\in E$, and it is $\\{u, v\\}$ otherwise. Here reachability is defined by forward chaining, a standard marking algorithm.\n  Various bounds are given for the hydra number. We show that the hyd"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07753","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":""},"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-05-18T02:17:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M0ozT5AXJYHOsS+u2Qz7+W+iZtSeBTOr8U94Ly0Nj/IcO36HrPaKwxI1vEDFe9YXgO6k4QuafWOGLNlJFR1CBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:03:55.422497Z"},"content_sha256":"43f7f14562bb274fbfd9e1120fce99b40a1a4bff2ebbd70b9bdf32a7bd841186","schema_version":"1.0","event_id":"sha256:43f7f14562bb274fbfd9e1120fce99b40a1a4bff2ebbd70b9bdf32a7bd841186"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJSBZHIBTFSMVAHCR6XHDZTW5B/bundle.json","state_url":"https://pith.science/pith/CJSBZHIBTFSMVAHCR6XHDZTW5B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJSBZHIBTFSMVAHCR6XHDZTW5B/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-06-05T08:03:55Z","links":{"resolver":"https://pith.science/pith/CJSBZHIBTFSMVAHCR6XHDZTW5B","bundle":"https://pith.science/pith/CJSBZHIBTFSMVAHCR6XHDZTW5B/bundle.json","state":"https://pith.science/pith/CJSBZHIBTFSMVAHCR6XHDZTW5B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJSBZHIBTFSMVAHCR6XHDZTW5B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CJSBZHIBTFSMVAHCR6XHDZTW5B","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":"95dd8fbb542079baf5447e1ad442f5e46676af69ade9a57514d5bc703b957a80","cross_cats_sorted":["cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-29T08:08:39Z","title_canon_sha256":"563b4694c3a98635b5f7e1cef5013732cc65480a5716a54a4cdd9b0f5a58bb8c"},"schema_version":"1.0","source":{"id":"1504.07753","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07753","created_at":"2026-05-18T02:17:32Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07753v1","created_at":"2026-05-18T02:17:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07753","created_at":"2026-05-18T02:17:32Z"},{"alias_kind":"pith_short_12","alias_value":"CJSBZHIBTFSM","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CJSBZHIBTFSMVAHC","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CJSBZHIB","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:43f7f14562bb274fbfd9e1120fce99b40a1a4bff2ebbd70b9bdf32a7bd841186","target":"graph","created_at":"2026-05-18T02:17:32Z","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"},"paper":{"abstract_excerpt":"We introduce a new graph parameter, the hydra number, arising from the minimization problem for Horn formulas in propositional logic. The hydra number of a graph $G=(V,E)$ is the minimal number of hyperarcs of the form $u,v\\rightarrow w$ required in a directed hypergraph $H=(V,F)$, such that for every pair $(u, v)$, the set of vertices reachable in $H$ from $\\{u, v\\}$ is the entire vertex set $V$ if $(u, v) \\in E$, and it is $\\{u, v\\}$ otherwise. Here reachability is defined by forward chaining, a standard marking algorithm.\n  Various bounds are given for the hydra number. We show that the hyd","authors_text":"Despina Stasi, Gyorgy Turan, Robert H. Sloan","cross_cats":["cs.LO","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-29T08:08:39Z","title":"Hydras: Directed Hypergraphs and Horn Formulas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07753","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:bc933db17dfea5804226d9387f3da3456ffe00abb2519df29e94e77b2a4d9c0e","target":"record","created_at":"2026-05-18T02:17:32Z","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":"95dd8fbb542079baf5447e1ad442f5e46676af69ade9a57514d5bc703b957a80","cross_cats_sorted":["cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-29T08:08:39Z","title_canon_sha256":"563b4694c3a98635b5f7e1cef5013732cc65480a5716a54a4cdd9b0f5a58bb8c"},"schema_version":"1.0","source":{"id":"1504.07753","kind":"arxiv","version":1}},"canonical_sha256":"12641c9d019964ca80e28fae71e676e8439f5141b7347663490a6ebaa89734ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12641c9d019964ca80e28fae71e676e8439f5141b7347663490a6ebaa89734ca","first_computed_at":"2026-05-18T02:17:32.343807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:32.343807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"77WMp/UZyPm25SDouB1uTnFklPbhLEeX8/4Jptu1noG/Bac994Qxgn46CPDrK/CKrQ6ywi8EL5uBuzlSsypTBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:32.344554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.07753","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc933db17dfea5804226d9387f3da3456ffe00abb2519df29e94e77b2a4d9c0e","sha256:43f7f14562bb274fbfd9e1120fce99b40a1a4bff2ebbd70b9bdf32a7bd841186"],"state_sha256":"779110e681af5cc81d873be751a81b9d413e257588e015abdf7c4eeed5f83574"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HJ+zTl0J99AUi55Az2cMwuXzwQkJF4m7mGbRW5YiFloyWm4v3H8Du26sD/HJC0gBNcAI6nQ37icHaqE/zQR+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:03:55.425467Z","bundle_sha256":"9b47916940750a09175666f3b23f3033c5727537bd18bbb7b64fa773b5aed3e1"}}