{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BFKX3VIWRB7DFJIYFNIMNHTPFP","short_pith_number":"pith:BFKX3VIW","canonical_record":{"source":{"id":"1805.03405","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-09T08:15:55Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"290aa9390438657059be994936abe7e994dfef2ebaefaf1d4c619d5cc73ca7c5","abstract_canon_sha256":"e6aee5296a3568cf929e15a1d33b9c33dcfcc126c9d06634bb6c9f170fbee752"},"schema_version":"1.0"},"canonical_sha256":"09557dd516887e32a5182b50c69e6f2bd51724b0c22a3e96134a08ceef3909da","source":{"kind":"arxiv","id":"1805.03405","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03405","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03405v3","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03405","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"pith_short_12","alias_value":"BFKX3VIWRB7D","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BFKX3VIWRB7DFJIY","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BFKX3VIW","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BFKX3VIWRB7DFJIYFNIMNHTPFP","target":"record","payload":{"canonical_record":{"source":{"id":"1805.03405","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-09T08:15:55Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"290aa9390438657059be994936abe7e994dfef2ebaefaf1d4c619d5cc73ca7c5","abstract_canon_sha256":"e6aee5296a3568cf929e15a1d33b9c33dcfcc126c9d06634bb6c9f170fbee752"},"schema_version":"1.0"},"canonical_sha256":"09557dd516887e32a5182b50c69e6f2bd51724b0c22a3e96134a08ceef3909da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:43.934738Z","signature_b64":"pDl7Y1kb4OIBAiw1tDbcmN48OuGL1dg65KrWsX2CweFQvOEyiXfkUvbCSwcShPvTYWAV6m9vkkri2jQmPg0WDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09557dd516887e32a5182b50c69e6f2bd51724b0c22a3e96134a08ceef3909da","last_reissued_at":"2026-05-18T00:14:43.934284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:43.934284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.03405","source_version":3,"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-18T00:14:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"93GG2+2ddHLc6hPBTQyBksZZpENw8fK0CQjjlNGogJ7nZ4Xbv1lU6Bcq4fPRLCCQvLDcCJz8FVqdg6eoDNnQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:27:58.985863Z"},"content_sha256":"07c9d39d1ab57ae90cc92cf31843c7ef81be9b53005594a598b42113d4d93a19","schema_version":"1.0","event_id":"sha256:07c9d39d1ab57ae90cc92cf31843c7ef81be9b53005594a598b42113d4d93a19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BFKX3VIWRB7DFJIYFNIMNHTPFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Endre Boros, Martin Milani\\v{c}, Vladimir Gurvich","submitted_at":"2018-05-09T08:15:55Z","abstract_excerpt":"A hypergraph is said to be $1$-Sperner if for every two hyperedges the smallest of their two set differences is of size one. We present several applications of $1$-Sperner hypergraphs and their structure to graphs. In particular, we consider the classical characterizations of threshold and domishold graphs and use them to obtain further characterizations of these classes in terms of $1$-Spernerness, thresholdness, and $2$-asummability of their vertex cover, clique, dominating set, and closed neighborhood hypergraphs. Furthermore, we apply a decomposition property of $1$-Sperner hypergraphs to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03405","kind":"arxiv","version":3},"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-18T00:14:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rwVTXQJAAP/KydGwaH/qNXbLhpCTnAFYX7RYv7NOd+p1rDHmwWe9Qj1KNkzbDKP7LiPVPMNENvjtWyd54JiUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:27:58.986217Z"},"content_sha256":"85852567f19075040347a160fc34a898c0a653aa192e047089c58a9ae7b65167","schema_version":"1.0","event_id":"sha256:85852567f19075040347a160fc34a898c0a653aa192e047089c58a9ae7b65167"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BFKX3VIWRB7DFJIYFNIMNHTPFP/bundle.json","state_url":"https://pith.science/pith/BFKX3VIWRB7DFJIYFNIMNHTPFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BFKX3VIWRB7DFJIYFNIMNHTPFP/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-01T17:27:58Z","links":{"resolver":"https://pith.science/pith/BFKX3VIWRB7DFJIYFNIMNHTPFP","bundle":"https://pith.science/pith/BFKX3VIWRB7DFJIYFNIMNHTPFP/bundle.json","state":"https://pith.science/pith/BFKX3VIWRB7DFJIYFNIMNHTPFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BFKX3VIWRB7DFJIYFNIMNHTPFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BFKX3VIWRB7DFJIYFNIMNHTPFP","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":"e6aee5296a3568cf929e15a1d33b9c33dcfcc126c9d06634bb6c9f170fbee752","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-09T08:15:55Z","title_canon_sha256":"290aa9390438657059be994936abe7e994dfef2ebaefaf1d4c619d5cc73ca7c5"},"schema_version":"1.0","source":{"id":"1805.03405","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03405","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03405v3","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03405","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"pith_short_12","alias_value":"BFKX3VIWRB7D","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BFKX3VIWRB7DFJIY","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BFKX3VIW","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:85852567f19075040347a160fc34a898c0a653aa192e047089c58a9ae7b65167","target":"graph","created_at":"2026-05-18T00:14:43Z","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":"A hypergraph is said to be $1$-Sperner if for every two hyperedges the smallest of their two set differences is of size one. We present several applications of $1$-Sperner hypergraphs and their structure to graphs. In particular, we consider the classical characterizations of threshold and domishold graphs and use them to obtain further characterizations of these classes in terms of $1$-Spernerness, thresholdness, and $2$-asummability of their vertex cover, clique, dominating set, and closed neighborhood hypergraphs. Furthermore, we apply a decomposition property of $1$-Sperner hypergraphs to ","authors_text":"Endre Boros, Martin Milani\\v{c}, Vladimir Gurvich","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-09T08:15:55Z","title":"Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03405","kind":"arxiv","version":3},"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:07c9d39d1ab57ae90cc92cf31843c7ef81be9b53005594a598b42113d4d93a19","target":"record","created_at":"2026-05-18T00:14:43Z","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":"e6aee5296a3568cf929e15a1d33b9c33dcfcc126c9d06634bb6c9f170fbee752","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-09T08:15:55Z","title_canon_sha256":"290aa9390438657059be994936abe7e994dfef2ebaefaf1d4c619d5cc73ca7c5"},"schema_version":"1.0","source":{"id":"1805.03405","kind":"arxiv","version":3}},"canonical_sha256":"09557dd516887e32a5182b50c69e6f2bd51724b0c22a3e96134a08ceef3909da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09557dd516887e32a5182b50c69e6f2bd51724b0c22a3e96134a08ceef3909da","first_computed_at":"2026-05-18T00:14:43.934284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:43.934284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pDl7Y1kb4OIBAiw1tDbcmN48OuGL1dg65KrWsX2CweFQvOEyiXfkUvbCSwcShPvTYWAV6m9vkkri2jQmPg0WDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:43.934738Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03405","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07c9d39d1ab57ae90cc92cf31843c7ef81be9b53005594a598b42113d4d93a19","sha256:85852567f19075040347a160fc34a898c0a653aa192e047089c58a9ae7b65167"],"state_sha256":"eac0b342b8a202e00b9995d1e16d6403c7717b9b35528aaf1f55e853e5039188"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w/uKJTmFcrgxfRepcudiwK8oOkpIxEM1cFPF+tp0Ojxk/hSAcOeV0BQ9IAAdWeivrtvVhwgn3RVfWv76QhV+Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:27:58.988187Z","bundle_sha256":"85fe9520f0dd76f5d7931e8da30bf4c2ac6967f216a85092a7512353512e182f"}}