{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:O2BMDIV3VYM26IXLPX7OVICT45","short_pith_number":"pith:O2BMDIV3","canonical_record":{"source":{"id":"2207.01661","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-07-04T18:21:49Z","cross_cats_sorted":[],"title_canon_sha256":"623139a05e5267d2583d1a50d7d4417af4c71e5ea0b01855303d85d6bc65c497","abstract_canon_sha256":"16497eab970c6ccfc99cb42600894664582b4cdbfd0aa8bb68b8ecabfc5b0e61"},"schema_version":"1.0"},"canonical_sha256":"7682c1a2bbae19af22eb7dfeeaa053e76ea9fc54ee3edaefa61f0836d785bed0","source":{"kind":"arxiv","id":"2207.01661","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.01661","created_at":"2026-07-05T06:58:53Z"},{"alias_kind":"arxiv_version","alias_value":"2207.01661v3","created_at":"2026-07-05T06:58:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.01661","created_at":"2026-07-05T06:58:53Z"},{"alias_kind":"pith_short_12","alias_value":"O2BMDIV3VYM2","created_at":"2026-07-05T06:58:53Z"},{"alias_kind":"pith_short_16","alias_value":"O2BMDIV3VYM26IXL","created_at":"2026-07-05T06:58:53Z"},{"alias_kind":"pith_short_8","alias_value":"O2BMDIV3","created_at":"2026-07-05T06:58:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:O2BMDIV3VYM26IXLPX7OVICT45","target":"record","payload":{"canonical_record":{"source":{"id":"2207.01661","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-07-04T18:21:49Z","cross_cats_sorted":[],"title_canon_sha256":"623139a05e5267d2583d1a50d7d4417af4c71e5ea0b01855303d85d6bc65c497","abstract_canon_sha256":"16497eab970c6ccfc99cb42600894664582b4cdbfd0aa8bb68b8ecabfc5b0e61"},"schema_version":"1.0"},"canonical_sha256":"7682c1a2bbae19af22eb7dfeeaa053e76ea9fc54ee3edaefa61f0836d785bed0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:58:53.209668Z","signature_b64":"AGjF0AbmX8WXLy6Ym0YhzyAR0IsbBW5ZdsYPaSqdEpxbmN0DRrDOhxiHmGQwqQ57oL3MMaWrXuEf3R+QEYS3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7682c1a2bbae19af22eb7dfeeaa053e76ea9fc54ee3edaefa61f0836d785bed0","last_reissued_at":"2026-07-05T06:58:53.209114Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:58:53.209114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.01661","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-07-05T06:58:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6rQNODkk+AFaXbhGVT0varf0lacjVTEYVeFQPBHcZnOaRZKu2nDyOAVA5ZHZDv4h0xu/BMY7IGyZLu610X3BDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T02:12:47.658261Z"},"content_sha256":"41a53ac561eed612cb82ee9d987423f4939e0cb4e67d1965b9c7d07b591c548c","schema_version":"1.0","event_id":"sha256:41a53ac561eed612cb82ee9d987423f4939e0cb4e67d1965b9c7d07b591c548c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:O2BMDIV3VYM26IXLPX7OVICT45","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Holroyd-Talbot Conjecture for Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Glenn Hurlbert, Peter Frankl","submitted_at":"2022-07-04T18:21:49Z","abstract_excerpt":"Given a graph $G$, let $\\mu(G)$ denote the size of the smallest maximal independent set in $G$. A family of subsets is called a star if some element is in every set of the family. A split vertex has degree at least 3. Holroyd and Talbot conjectured the following Erd\\H{o}s-Ko-Rado type statement about intersecting families of independent sets in graphs: if $1\\le r\\le \\mu(G)/2$ then there is an intersecting family of independent $r$-sets of maximum size that is a star. In this paper we prove similar statements for sparse graphs on $n$ vertices: roughly, for graphs of bounded average degree with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.01661","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.01661/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-07-05T06:58:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CkzeoTtgB6dAkim+qjouXNlrMZwg2QwRzxS9kUDDA7pRan5R6gXzpifRffBkeW2mnc8h9e8VxP7MUpaMlKxBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T02:12:47.658722Z"},"content_sha256":"fd6966b4e6c380ebcba638aa08f4658729a2cf83481179f7777332b006e8b0bb","schema_version":"1.0","event_id":"sha256:fd6966b4e6c380ebcba638aa08f4658729a2cf83481179f7777332b006e8b0bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2BMDIV3VYM26IXLPX7OVICT45/bundle.json","state_url":"https://pith.science/pith/O2BMDIV3VYM26IXLPX7OVICT45/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2BMDIV3VYM26IXLPX7OVICT45/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-07-09T02:12:47Z","links":{"resolver":"https://pith.science/pith/O2BMDIV3VYM26IXLPX7OVICT45","bundle":"https://pith.science/pith/O2BMDIV3VYM26IXLPX7OVICT45/bundle.json","state":"https://pith.science/pith/O2BMDIV3VYM26IXLPX7OVICT45/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2BMDIV3VYM26IXLPX7OVICT45/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:O2BMDIV3VYM26IXLPX7OVICT45","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":"16497eab970c6ccfc99cb42600894664582b4cdbfd0aa8bb68b8ecabfc5b0e61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-07-04T18:21:49Z","title_canon_sha256":"623139a05e5267d2583d1a50d7d4417af4c71e5ea0b01855303d85d6bc65c497"},"schema_version":"1.0","source":{"id":"2207.01661","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.01661","created_at":"2026-07-05T06:58:53Z"},{"alias_kind":"arxiv_version","alias_value":"2207.01661v3","created_at":"2026-07-05T06:58:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.01661","created_at":"2026-07-05T06:58:53Z"},{"alias_kind":"pith_short_12","alias_value":"O2BMDIV3VYM2","created_at":"2026-07-05T06:58:53Z"},{"alias_kind":"pith_short_16","alias_value":"O2BMDIV3VYM26IXL","created_at":"2026-07-05T06:58:53Z"},{"alias_kind":"pith_short_8","alias_value":"O2BMDIV3","created_at":"2026-07-05T06:58:53Z"}],"graph_snapshots":[{"event_id":"sha256:fd6966b4e6c380ebcba638aa08f4658729a2cf83481179f7777332b006e8b0bb","target":"graph","created_at":"2026-07-05T06:58:53Z","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/2207.01661/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph $G$, let $\\mu(G)$ denote the size of the smallest maximal independent set in $G$. A family of subsets is called a star if some element is in every set of the family. A split vertex has degree at least 3. Holroyd and Talbot conjectured the following Erd\\H{o}s-Ko-Rado type statement about intersecting families of independent sets in graphs: if $1\\le r\\le \\mu(G)/2$ then there is an intersecting family of independent $r$-sets of maximum size that is a star. In this paper we prove similar statements for sparse graphs on $n$ vertices: roughly, for graphs of bounded average degree with ","authors_text":"Glenn Hurlbert, Peter Frankl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-07-04T18:21:49Z","title":"On the Holroyd-Talbot Conjecture for Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.01661","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:41a53ac561eed612cb82ee9d987423f4939e0cb4e67d1965b9c7d07b591c548c","target":"record","created_at":"2026-07-05T06:58:53Z","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":"16497eab970c6ccfc99cb42600894664582b4cdbfd0aa8bb68b8ecabfc5b0e61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-07-04T18:21:49Z","title_canon_sha256":"623139a05e5267d2583d1a50d7d4417af4c71e5ea0b01855303d85d6bc65c497"},"schema_version":"1.0","source":{"id":"2207.01661","kind":"arxiv","version":3}},"canonical_sha256":"7682c1a2bbae19af22eb7dfeeaa053e76ea9fc54ee3edaefa61f0836d785bed0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7682c1a2bbae19af22eb7dfeeaa053e76ea9fc54ee3edaefa61f0836d785bed0","first_computed_at":"2026-07-05T06:58:53.209114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:58:53.209114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AGjF0AbmX8WXLy6Ym0YhzyAR0IsbBW5ZdsYPaSqdEpxbmN0DRrDOhxiHmGQwqQ57oL3MMaWrXuEf3R+QEYS3Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:58:53.209668Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.01661","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41a53ac561eed612cb82ee9d987423f4939e0cb4e67d1965b9c7d07b591c548c","sha256:fd6966b4e6c380ebcba638aa08f4658729a2cf83481179f7777332b006e8b0bb"],"state_sha256":"d7bf3a789a1709a4d6d7d5d4dfe6ab6de77bd5a44305b29b822431a8c3b83ee0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EV8nXTfJLs8Sk1OJodahFWAyXyREPKgseZsJYuKpDaeEolZyO6b4AAeX3gq5emlZhqWa1enD/LXvdWJqyAXIAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T02:12:47.660799Z","bundle_sha256":"ee49df63dc07d3a6663c94b8abf7bb362228803ef6b3b2aba22a7fb6b2b8b3b3"}}