{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:O2BMDIV3VYM26IXLPX7OVICT45","short_pith_number":"pith:O2BMDIV3","schema_version":"1.0","canonical_sha256":"7682c1a2bbae19af22eb7dfeeaa053e76ea9fc54ee3edaefa61f0836d785bed0","source":{"kind":"arxiv","id":"2207.01661","version":3},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2207.01661","created_at":"2026-07-05T06:58:53.209171+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.01661v3","created_at":"2026-07-05T06:58:53.209171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.01661","created_at":"2026-07-05T06:58:53.209171+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2BMDIV3VYM2","created_at":"2026-07-05T06:58:53.209171+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2BMDIV3VYM26IXL","created_at":"2026-07-05T06:58:53.209171+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2BMDIV3","created_at":"2026-07-05T06:58:53.209171+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/O2BMDIV3VYM26IXLPX7OVICT45","json":"https://pith.science/pith/O2BMDIV3VYM26IXLPX7OVICT45.json","graph_json":"https://pith.science/api/pith-number/O2BMDIV3VYM26IXLPX7OVICT45/graph.json","events_json":"https://pith.science/api/pith-number/O2BMDIV3VYM26IXLPX7OVICT45/events.json","paper":"https://pith.science/paper/O2BMDIV3"},"agent_actions":{"view_html":"https://pith.science/pith/O2BMDIV3VYM26IXLPX7OVICT45","download_json":"https://pith.science/pith/O2BMDIV3VYM26IXLPX7OVICT45.json","view_paper":"https://pith.science/paper/O2BMDIV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.01661&json=true","fetch_graph":"https://pith.science/api/pith-number/O2BMDIV3VYM26IXLPX7OVICT45/graph.json","fetch_events":"https://pith.science/api/pith-number/O2BMDIV3VYM26IXLPX7OVICT45/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2BMDIV3VYM26IXLPX7OVICT45/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2BMDIV3VYM26IXLPX7OVICT45/action/storage_attestation","attest_author":"https://pith.science/pith/O2BMDIV3VYM26IXLPX7OVICT45/action/author_attestation","sign_citation":"https://pith.science/pith/O2BMDIV3VYM26IXLPX7OVICT45/action/citation_signature","submit_replication":"https://pith.science/pith/O2BMDIV3VYM26IXLPX7OVICT45/action/replication_record"}},"created_at":"2026-07-05T06:58:53.209171+00:00","updated_at":"2026-07-05T06:58:53.209171+00:00"}