{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XLTI6JOIQG47ASEYDZN4WIV3F4","short_pith_number":"pith:XLTI6JOI","schema_version":"1.0","canonical_sha256":"bae68f25c881b9f048981e5bcb22bb2f0285712856fa949c1697fd284bb1f228","source":{"kind":"arxiv","id":"2106.09067","version":2},"attestation_state":"computed","paper":{"title":"Very Well-Covered Graphs with the Erd\\H{o}s-Ko-Rado Property","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam B. Dionne, Aidan Dunkelberg, Jessica De Silva, Pamela E. Harris","submitted_at":"2021-06-16T18:18:09Z","abstract_excerpt":"A family of independent $r$-sets of a graph $G$ is an $r$-star if every set in the family contains some fixed vertex $v$. A graph is $r$-EKR if the maximum size of an intersecting family of independent $r$-sets is the size of an $r$-star. Holroyd and Talbot conjecture that a graph is $r$-EKR as long as $1\\leq r\\leq\\frac{\\mu(G)}{2}$, where $\\mu(G)$ is the minimum size of a maximal independent set. It is suspected that the smallest counterexample to this conjecture is a well-covered graph. Here we consider the class of very well-covered graphs $G^*$ obtained by appending a single pendant edge to"},"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":"2106.09067","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-06-16T18:18:09Z","cross_cats_sorted":[],"title_canon_sha256":"2187e9292e557b9b03a357d50776b1bc79dda321e1908925f4d628591579a125","abstract_canon_sha256":"eede2e6b5c263288fe08a97270e041f548400f297fd39bb72437c650d4cf68f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:02:22.503736Z","signature_b64":"zwFkaBIxXWYkyhkMt5R87llyKkTZ7DXKPr84PdN79PoYu5a8R7Hpu0JxP/aYX01p+ufxBsQT6fcCvtKbwwdLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bae68f25c881b9f048981e5bcb22bb2f0285712856fa949c1697fd284bb1f228","last_reissued_at":"2026-07-05T06:02:22.503233Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:02:22.503233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Very Well-Covered Graphs with the Erd\\H{o}s-Ko-Rado Property","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam B. Dionne, Aidan Dunkelberg, Jessica De Silva, Pamela E. Harris","submitted_at":"2021-06-16T18:18:09Z","abstract_excerpt":"A family of independent $r$-sets of a graph $G$ is an $r$-star if every set in the family contains some fixed vertex $v$. A graph is $r$-EKR if the maximum size of an intersecting family of independent $r$-sets is the size of an $r$-star. Holroyd and Talbot conjecture that a graph is $r$-EKR as long as $1\\leq r\\leq\\frac{\\mu(G)}{2}$, where $\\mu(G)$ is the minimum size of a maximal independent set. It is suspected that the smallest counterexample to this conjecture is a well-covered graph. Here we consider the class of very well-covered graphs $G^*$ obtained by appending a single pendant edge to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.09067","kind":"arxiv","version":2},"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/2106.09067/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":"2106.09067","created_at":"2026-07-05T06:02:22.503297+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.09067v2","created_at":"2026-07-05T06:02:22.503297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.09067","created_at":"2026-07-05T06:02:22.503297+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLTI6JOIQG47","created_at":"2026-07-05T06:02:22.503297+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLTI6JOIQG47ASEY","created_at":"2026-07-05T06:02:22.503297+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLTI6JOI","created_at":"2026-07-05T06:02:22.503297+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/XLTI6JOIQG47ASEYDZN4WIV3F4","json":"https://pith.science/pith/XLTI6JOIQG47ASEYDZN4WIV3F4.json","graph_json":"https://pith.science/api/pith-number/XLTI6JOIQG47ASEYDZN4WIV3F4/graph.json","events_json":"https://pith.science/api/pith-number/XLTI6JOIQG47ASEYDZN4WIV3F4/events.json","paper":"https://pith.science/paper/XLTI6JOI"},"agent_actions":{"view_html":"https://pith.science/pith/XLTI6JOIQG47ASEYDZN4WIV3F4","download_json":"https://pith.science/pith/XLTI6JOIQG47ASEYDZN4WIV3F4.json","view_paper":"https://pith.science/paper/XLTI6JOI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.09067&json=true","fetch_graph":"https://pith.science/api/pith-number/XLTI6JOIQG47ASEYDZN4WIV3F4/graph.json","fetch_events":"https://pith.science/api/pith-number/XLTI6JOIQG47ASEYDZN4WIV3F4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLTI6JOIQG47ASEYDZN4WIV3F4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLTI6JOIQG47ASEYDZN4WIV3F4/action/storage_attestation","attest_author":"https://pith.science/pith/XLTI6JOIQG47ASEYDZN4WIV3F4/action/author_attestation","sign_citation":"https://pith.science/pith/XLTI6JOIQG47ASEYDZN4WIV3F4/action/citation_signature","submit_replication":"https://pith.science/pith/XLTI6JOIQG47ASEYDZN4WIV3F4/action/replication_record"}},"created_at":"2026-07-05T06:02:22.503297+00:00","updated_at":"2026-07-05T06:02:22.503297+00:00"}