{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HEXN2AHQYWHJ55EWCM3FTM7VUV","short_pith_number":"pith:HEXN2AHQ","canonical_record":{"source":{"id":"2608.06820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-07T05:20:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d800b814add06f5b91f2a60b78801e961fbe2e73538837f88c77607b4641ba9f","abstract_canon_sha256":"61324d6f5ca16e3a8b87763451748ad04f51739d8019b9db31f75b27aff648ec"},"schema_version":"1.0"},"canonical_sha256":"392edd00f0c58e9ef496133659b3f5a55945db41ccb8b50f7a80f0663374facc","source":{"kind":"arxiv","id":"2608.06820","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.06820","created_at":"2026-08-10T01:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"2608.06820v1","created_at":"2026-08-10T01:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.06820","created_at":"2026-08-10T01:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"HEXN2AHQYWHJ","created_at":"2026-08-10T01:12:11Z"},{"alias_kind":"pith_short_16","alias_value":"HEXN2AHQYWHJ55EW","created_at":"2026-08-10T01:12:11Z"},{"alias_kind":"pith_short_8","alias_value":"HEXN2AHQ","created_at":"2026-08-10T01:12:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HEXN2AHQYWHJ55EWCM3FTM7VUV","target":"record","payload":{"canonical_record":{"source":{"id":"2608.06820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-07T05:20:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d800b814add06f5b91f2a60b78801e961fbe2e73538837f88c77607b4641ba9f","abstract_canon_sha256":"61324d6f5ca16e3a8b87763451748ad04f51739d8019b9db31f75b27aff648ec"},"schema_version":"1.0"},"canonical_sha256":"392edd00f0c58e9ef496133659b3f5a55945db41ccb8b50f7a80f0663374facc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-10T01:12:11.413755Z","signature_b64":"QEbAqQxtzIs7uPllnWrkUfRy3c64hyuwyllnOiAsNBwnEI1EkrdXEwmUmjiX4vgorddPjV/uMiHHvO6H6LlnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"392edd00f0c58e9ef496133659b3f5a55945db41ccb8b50f7a80f0663374facc","last_reissued_at":"2026-08-10T01:12:11.411284Z","signature_status":"signed_v1","first_computed_at":"2026-08-10T01:12:11.411284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.06820","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-08-10T01:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F4CaxaV+/NedE5vFePt8j3XfaMQxRzI9DJdpTgPU+veCNf9Nh00vLpBnelXrIT23isLtkrojvuswXDqxS/6PAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T13:29:21.258957Z"},"content_sha256":"f0415a50f66c10b8d25f628170fda63ef4f76702fae367247875a160dac9fa2d","schema_version":"1.0","event_id":"sha256:f0415a50f66c10b8d25f628170fda63ef4f76702fae367247875a160dac9fa2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HEXN2AHQYWHJ55EWCM3FTM7VUV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coatom Enumeration in Hypergraph Horn Functions: Rank-Three Representations of Horn Model Posets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Jianshen Zhu","submitted_at":"2026-08-07T05:20:16Z","abstract_excerpt":"For a finite hypergraph H, the complements of the models of its associated definite Horn CNF are exactly the stopping sets of H; hence the complements of its coatoms are the inclusion-minimal nonempty stopping sets. We study their output-sensitive enumeration from the hypergraph incidence representation. Our main result is a representation of arbitrary Horn model posets whose incidence size is linear in the incidence length of the normalized Horn input. Given a Horn CNF $\\Gamma$, we construct a hypergraph $C(\\Gamma)$ of rank at most three whose proper-model poset is inclusion-order isomorphic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.06820","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/2608.06820/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-08-10T01:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+kQWhoLEFX14qrkI/BrZmqjZQ13/6HUSPmQ9/VXT3nWq6VTJBBgZhgc+H292Ec9kyveEHE5opW+HESkmXAl/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T13:29:21.259457Z"},"content_sha256":"b10436838991a137b0bd425ef545bdbc7d4c079a6ade4d0fa227ebc5d36890d4","schema_version":"1.0","event_id":"sha256:b10436838991a137b0bd425ef545bdbc7d4c079a6ade4d0fa227ebc5d36890d4"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:HEXN2AHQYWHJ55EWCM3FTM7VUV","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/TIT.2005.864441) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Moshe Schwartz and Alexander Vardy. On the stopping distance and the stopping redundancy of codes.IEEE Transactions on Information Theory, 52(3):922–932, 2006. doi: 10.1109/TIT.2005. 864441","arxiv_id":"2608.06820","detector":"doi_compliance","evidence":{"ref_index":24,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1109/tit.2005","reconstructed_doi":"10.1109/TIT.2005.864441"},"severity":"advisory","ref_index":24,"audited_at":"2026-08-10T20:28:19.674751Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/TIT.2005.864441","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"e6dc46931764f923fd85af988a2d243ac177a612f7d16de647a02fd247e7e0e6","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":18894,"payload_sha256":"0aeb3b1f34f993c00f5e07058457a2435019b82df1360336ecc3828791956f31","signature_b64":"kcsZAqFrx1Lyq+7CAHPEPppZ7AWM7jdBUUtdLpyJQvaKsbCFdM+1FUDvp19YQoxmYkf+aWC5amN1xzmrhzsAAQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-10T20:28:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eWr9FwysgOBfHR2ZHecZ67rkq/NnZZVIPV0q5kTOVOjrykp7G/KnVUFVqjOWgnfn6HEGa9j8a57fJ4OCBfN/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T13:29:21.262817Z"},"content_sha256":"e98fec12d7b73af3b9414241c656f9829474b2477bd22190a2c3e41b298d68a7","schema_version":"1.0","event_id":"sha256:e98fec12d7b73af3b9414241c656f9829474b2477bd22190a2c3e41b298d68a7"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:HEXN2AHQYWHJ55EWCM3FTM7VUV","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4230/LIPIcs.MFCS.2019.36) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Victor Lagerkvist and Gustav Nordh. On the strength of uniqueness quantification in primitive positive formulas. In44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), volume 138 ofLeibniz International ","arxiv_id":"2608.06820","detector":"doi_compliance","evidence":{"ref_index":18,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.4230/lipics","reconstructed_doi":"10.4230/LIPIcs.MFCS.2019.36"},"severity":"advisory","ref_index":18,"audited_at":"2026-08-10T20:28:19.674751Z","event_type":"pith.integrity.v1","detected_doi":"10.4230/LIPIcs.MFCS.2019.36","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"81e0bfa179ce10831732858f0bc1e7fafec8436d64f0dda43dea0c79807bb70b","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":18893,"payload_sha256":"60c3b1525a12e4803fc36a43a937065a66760f3f7c0146988de5e6a1806ac721","signature_b64":"K3oDXasuQZilJE44GQb+2jjDtHEaLGNJgYa+jNYXG//8kRO4wItR44HJlStfDvbNhKyuKMicMr3QBfIdagJIAA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-10T20:28:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WeTnLppwmEyvQx7UYbnp0UN4YYZ6IFsDM13xBxU7ptLkQE89Bp3MYDlC3Y9FCJb+g4V+KrnWsnZCRRHWYSkfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T13:29:21.263265Z"},"content_sha256":"84828a523d82d9b24527217122d9b222cecc31b7f6c1b5ca1a338d59aeca280e","schema_version":"1.0","event_id":"sha256:84828a523d82d9b24527217122d9b222cecc31b7f6c1b5ca1a338d59aeca280e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HEXN2AHQYWHJ55EWCM3FTM7VUV/bundle.json","state_url":"https://pith.science/pith/HEXN2AHQYWHJ55EWCM3FTM7VUV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HEXN2AHQYWHJ55EWCM3FTM7VUV/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-12T13:29:21Z","links":{"resolver":"https://pith.science/pith/HEXN2AHQYWHJ55EWCM3FTM7VUV","bundle":"https://pith.science/pith/HEXN2AHQYWHJ55EWCM3FTM7VUV/bundle.json","state":"https://pith.science/pith/HEXN2AHQYWHJ55EWCM3FTM7VUV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HEXN2AHQYWHJ55EWCM3FTM7VUV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HEXN2AHQYWHJ55EWCM3FTM7VUV","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"61324d6f5ca16e3a8b87763451748ad04f51739d8019b9db31f75b27aff648ec","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-07T05:20:16Z","title_canon_sha256":"d800b814add06f5b91f2a60b78801e961fbe2e73538837f88c77607b4641ba9f"},"schema_version":"1.0","source":{"id":"2608.06820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.06820","created_at":"2026-08-10T01:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"2608.06820v1","created_at":"2026-08-10T01:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.06820","created_at":"2026-08-10T01:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"HEXN2AHQYWHJ","created_at":"2026-08-10T01:12:11Z"},{"alias_kind":"pith_short_16","alias_value":"HEXN2AHQYWHJ55EW","created_at":"2026-08-10T01:12:11Z"},{"alias_kind":"pith_short_8","alias_value":"HEXN2AHQ","created_at":"2026-08-10T01:12:11Z"}],"graph_snapshots":[{"event_id":"sha256:b10436838991a137b0bd425ef545bdbc7d4c079a6ade4d0fa227ebc5d36890d4","target":"graph","created_at":"2026-08-10T01:12:11Z","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/2608.06820/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a finite hypergraph H, the complements of the models of its associated definite Horn CNF are exactly the stopping sets of H; hence the complements of its coatoms are the inclusion-minimal nonempty stopping sets. We study their output-sensitive enumeration from the hypergraph incidence representation. Our main result is a representation of arbitrary Horn model posets whose incidence size is linear in the incidence length of the normalized Horn input. Given a Horn CNF $\\Gamma$, we construct a hypergraph $C(\\Gamma)$ of rank at most three whose proper-model poset is inclusion-order isomorphic ","authors_text":"Jianshen Zhu","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-07T05:20:16Z","title":"Coatom Enumeration in Hypergraph Horn Functions: Rank-Three Representations of Horn Model Posets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.06820","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:f0415a50f66c10b8d25f628170fda63ef4f76702fae367247875a160dac9fa2d","target":"record","created_at":"2026-08-10T01:12:11Z","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":"61324d6f5ca16e3a8b87763451748ad04f51739d8019b9db31f75b27aff648ec","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-07T05:20:16Z","title_canon_sha256":"d800b814add06f5b91f2a60b78801e961fbe2e73538837f88c77607b4641ba9f"},"schema_version":"1.0","source":{"id":"2608.06820","kind":"arxiv","version":1}},"canonical_sha256":"392edd00f0c58e9ef496133659b3f5a55945db41ccb8b50f7a80f0663374facc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"392edd00f0c58e9ef496133659b3f5a55945db41ccb8b50f7a80f0663374facc","first_computed_at":"2026-08-10T01:12:11.411284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-10T01:12:11.411284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QEbAqQxtzIs7uPllnWrkUfRy3c64hyuwyllnOiAsNBwnEI1EkrdXEwmUmjiX4vgorddPjV/uMiHHvO6H6LlnAA==","signature_status":"signed_v1","signed_at":"2026-08-10T01:12:11.413755Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.06820","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:84828a523d82d9b24527217122d9b222cecc31b7f6c1b5ca1a338d59aeca280e","sha256:e98fec12d7b73af3b9414241c656f9829474b2477bd22190a2c3e41b298d68a7"]}],"invalid_events":[],"applied_event_ids":["sha256:f0415a50f66c10b8d25f628170fda63ef4f76702fae367247875a160dac9fa2d","sha256:b10436838991a137b0bd425ef545bdbc7d4c079a6ade4d0fa227ebc5d36890d4"],"state_sha256":"dd9cab941c37c12b655d37bf3ac1e4bb3c2208021e95bb208bd8d76aa78329e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pHdDq2OTfTDdsDq9QeJe8GP6TFIpEkYp/REkRmaw01tU81NlAqk9c9X3x9oSdeCpv7ujdJV9xuFN5BNY3mdxDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T13:29:21.265877Z","bundle_sha256":"22a524a25695d1e92ebf60ed8c6e6b8e94ad2d0b8f62a224ead05a644d0a8d34"}}