{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4JROOWPOL57TQ5VLWUPSHVTKR7","short_pith_number":"pith:4JROOWPO","schema_version":"1.0","canonical_sha256":"e262e759ee5f7f3876abb51f23d66a8fee933062d1e4f0c7fdac4e90800feb36","source":{"kind":"arxiv","id":"1910.08849","version":3},"attestation_state":"computed","paper":{"title":"An Erd\\H{o}s-Ko-Rado Theorem for unions of length 2 paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Feghali, Glenn Hurlbert, Vikram Kamat","submitted_at":"2019-10-19T21:46:44Z","abstract_excerpt":"A family of sets is intersecting if any two sets in the family intersect. Given a graph $G$ and an integer $r\\geq 1$, let $\\mathcal{I}^{(r)}(G)$ denote the family of independent sets of size $r$ of $G$. For a vertex $v$ of $G$, the family of independent sets of size $r$ that contain $v$ is called an $r$-star. Then $G$ is said to be $r$-EKR if no intersecting subfamily of $ \\mathcal{I}^{(r)}(G)$ is bigger than the largest $r$-star. Let $n$ be a positive integer, and let $G$ consist of the disjoint union of $n$ paths each of length 2. We prove that if $1 \\leq r \\leq n/2$, then $G$ is $r$-EKR. Th"},"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":"1910.08849","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-19T21:46:44Z","cross_cats_sorted":[],"title_canon_sha256":"c89be8eaeabcb8cc2a7713300c3b71c8d306f83eb0dbc6a7d4ce69ac9ac2adbb","abstract_canon_sha256":"03d4cc6a0691ec33c3f03cbd19e6317b37f76d58f02a0a161ffe82e37ccac5ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:29:01.233939Z","signature_b64":"KURufVekICWQsPSag/kNPsDnWafvrADyhmZbX/E7vKElxUDxOnGg5gZPd6nBSF0ukPN2zNJ4dw5uDlHlcYI1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e262e759ee5f7f3876abb51f23d66a8fee933062d1e4f0c7fdac4e90800feb36","last_reissued_at":"2026-07-05T01:29:01.233509Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:29:01.233509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Erd\\H{o}s-Ko-Rado Theorem for unions of length 2 paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Feghali, Glenn Hurlbert, Vikram Kamat","submitted_at":"2019-10-19T21:46:44Z","abstract_excerpt":"A family of sets is intersecting if any two sets in the family intersect. Given a graph $G$ and an integer $r\\geq 1$, let $\\mathcal{I}^{(r)}(G)$ denote the family of independent sets of size $r$ of $G$. For a vertex $v$ of $G$, the family of independent sets of size $r$ that contain $v$ is called an $r$-star. Then $G$ is said to be $r$-EKR if no intersecting subfamily of $ \\mathcal{I}^{(r)}(G)$ is bigger than the largest $r$-star. Let $n$ be a positive integer, and let $G$ consist of the disjoint union of $n$ paths each of length 2. We prove that if $1 \\leq r \\leq n/2$, then $G$ is $r$-EKR. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.08849","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/1910.08849/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":"1910.08849","created_at":"2026-07-05T01:29:01.233565+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.08849v3","created_at":"2026-07-05T01:29:01.233565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.08849","created_at":"2026-07-05T01:29:01.233565+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JROOWPOL57T","created_at":"2026-07-05T01:29:01.233565+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JROOWPOL57TQ5VL","created_at":"2026-07-05T01:29:01.233565+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JROOWPO","created_at":"2026-07-05T01:29:01.233565+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/4JROOWPOL57TQ5VLWUPSHVTKR7","json":"https://pith.science/pith/4JROOWPOL57TQ5VLWUPSHVTKR7.json","graph_json":"https://pith.science/api/pith-number/4JROOWPOL57TQ5VLWUPSHVTKR7/graph.json","events_json":"https://pith.science/api/pith-number/4JROOWPOL57TQ5VLWUPSHVTKR7/events.json","paper":"https://pith.science/paper/4JROOWPO"},"agent_actions":{"view_html":"https://pith.science/pith/4JROOWPOL57TQ5VLWUPSHVTKR7","download_json":"https://pith.science/pith/4JROOWPOL57TQ5VLWUPSHVTKR7.json","view_paper":"https://pith.science/paper/4JROOWPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.08849&json=true","fetch_graph":"https://pith.science/api/pith-number/4JROOWPOL57TQ5VLWUPSHVTKR7/graph.json","fetch_events":"https://pith.science/api/pith-number/4JROOWPOL57TQ5VLWUPSHVTKR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JROOWPOL57TQ5VLWUPSHVTKR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JROOWPOL57TQ5VLWUPSHVTKR7/action/storage_attestation","attest_author":"https://pith.science/pith/4JROOWPOL57TQ5VLWUPSHVTKR7/action/author_attestation","sign_citation":"https://pith.science/pith/4JROOWPOL57TQ5VLWUPSHVTKR7/action/citation_signature","submit_replication":"https://pith.science/pith/4JROOWPOL57TQ5VLWUPSHVTKR7/action/replication_record"}},"created_at":"2026-07-05T01:29:01.233565+00:00","updated_at":"2026-07-05T01:29:01.233565+00:00"}