{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XKLDDLDO4LSEHSWWCRWJG2AOZT","short_pith_number":"pith:XKLDDLDO","schema_version":"1.0","canonical_sha256":"ba9631ac6ee2e443cad6146c93680eccebfa0352d2d312e718dc116b4b6519d0","source":{"kind":"arxiv","id":"1602.01770","version":1},"attestation_state":"computed","paper":{"title":"Hypergraph Versals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Noah Streib, Vance Faber","submitted_at":"2016-02-04T18:10:23Z","abstract_excerpt":"Let H be a hypergraph on n vertices with the property that no edge contains another. We prove some results for a special case of the Isolation Lemma when the label set for the edges of H can only take two values. Given any set of vertices S and an edge e, the weight of S in e is the size of e plus the size of the intersection of S and e. A versal S for an edge e is a set of vertices with weight in e smaller than the weight in any other edge. We show that H always has at least n + 1 versals except if H is either the set of all singletons T_n or the complement of T_n or the 4-cycle graph. In tho"},"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":"1602.01770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-04T18:10:23Z","cross_cats_sorted":[],"title_canon_sha256":"c61f2b5c5c39951483cddd8767372f3a5924d114a7f65f44f3c4255bf5b2a80b","abstract_canon_sha256":"e23c1f0b60b259ef36a684edc1d387cafc6f83ee4dc726c1faa475b082c8b9ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:18.160561Z","signature_b64":"bPXfO23Q43kRx0qlLsMnL74yAJFyjLSH258Obw5uisB1dmk+MPTPyK8dkXkM7saYnx/2ldWqJgGwB//jfvaaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba9631ac6ee2e443cad6146c93680eccebfa0352d2d312e718dc116b4b6519d0","last_reissued_at":"2026-05-18T01:21:18.160002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:18.160002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph Versals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Noah Streib, Vance Faber","submitted_at":"2016-02-04T18:10:23Z","abstract_excerpt":"Let H be a hypergraph on n vertices with the property that no edge contains another. We prove some results for a special case of the Isolation Lemma when the label set for the edges of H can only take two values. Given any set of vertices S and an edge e, the weight of S in e is the size of e plus the size of the intersection of S and e. A versal S for an edge e is a set of vertices with weight in e smaller than the weight in any other edge. We show that H always has at least n + 1 versals except if H is either the set of all singletons T_n or the complement of T_n or the 4-cycle graph. In tho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01770","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.01770","created_at":"2026-05-18T01:21:18.160092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.01770v1","created_at":"2026-05-18T01:21:18.160092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01770","created_at":"2026-05-18T01:21:18.160092+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKLDDLDO4LSE","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKLDDLDO4LSEHSWW","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKLDDLDO","created_at":"2026-05-18T12:30:51.357362+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/XKLDDLDO4LSEHSWWCRWJG2AOZT","json":"https://pith.science/pith/XKLDDLDO4LSEHSWWCRWJG2AOZT.json","graph_json":"https://pith.science/api/pith-number/XKLDDLDO4LSEHSWWCRWJG2AOZT/graph.json","events_json":"https://pith.science/api/pith-number/XKLDDLDO4LSEHSWWCRWJG2AOZT/events.json","paper":"https://pith.science/paper/XKLDDLDO"},"agent_actions":{"view_html":"https://pith.science/pith/XKLDDLDO4LSEHSWWCRWJG2AOZT","download_json":"https://pith.science/pith/XKLDDLDO4LSEHSWWCRWJG2AOZT.json","view_paper":"https://pith.science/paper/XKLDDLDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.01770&json=true","fetch_graph":"https://pith.science/api/pith-number/XKLDDLDO4LSEHSWWCRWJG2AOZT/graph.json","fetch_events":"https://pith.science/api/pith-number/XKLDDLDO4LSEHSWWCRWJG2AOZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKLDDLDO4LSEHSWWCRWJG2AOZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKLDDLDO4LSEHSWWCRWJG2AOZT/action/storage_attestation","attest_author":"https://pith.science/pith/XKLDDLDO4LSEHSWWCRWJG2AOZT/action/author_attestation","sign_citation":"https://pith.science/pith/XKLDDLDO4LSEHSWWCRWJG2AOZT/action/citation_signature","submit_replication":"https://pith.science/pith/XKLDDLDO4LSEHSWWCRWJG2AOZT/action/replication_record"}},"created_at":"2026-05-18T01:21:18.160092+00:00","updated_at":"2026-05-18T01:21:18.160092+00:00"}