{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4JROOWPOL57TQ5VLWUPSHVTKR7","short_pith_number":"pith:4JROOWPO","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"},"canonical_sha256":"e262e759ee5f7f3876abb51f23d66a8fee933062d1e4f0c7fdac4e90800feb36","source":{"kind":"arxiv","id":"1910.08849","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.08849","created_at":"2026-07-05T01:29:01Z"},{"alias_kind":"arxiv_version","alias_value":"1910.08849v3","created_at":"2026-07-05T01:29:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.08849","created_at":"2026-07-05T01:29:01Z"},{"alias_kind":"pith_short_12","alias_value":"4JROOWPOL57T","created_at":"2026-07-05T01:29:01Z"},{"alias_kind":"pith_short_16","alias_value":"4JROOWPOL57TQ5VL","created_at":"2026-07-05T01:29:01Z"},{"alias_kind":"pith_short_8","alias_value":"4JROOWPO","created_at":"2026-07-05T01:29:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4JROOWPOL57TQ5VLWUPSHVTKR7","target":"record","payload":{"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"},"canonical_sha256":"e262e759ee5f7f3876abb51f23d66a8fee933062d1e4f0c7fdac4e90800feb36","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"},"source_kind":"arxiv","source_id":"1910.08849","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-05T01:29:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ialgtNvAwKQntfM1wGDSZ/+Aq0CslxetTBAhh2kQZcyYLcXu3qHSm6uzcPUdgDUUBHbHjjWZfPHoNGiG+mciDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:09:18.062697Z"},"content_sha256":"08f695bca5215461a2de7db2bd2bfc336e6b05fd53e9c7b8efb38ed08e55678b","schema_version":"1.0","event_id":"sha256:08f695bca5215461a2de7db2bd2bfc336e6b05fd53e9c7b8efb38ed08e55678b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4JROOWPOL57TQ5VLWUPSHVTKR7","target":"graph","payload":{"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"},"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-05T01:29:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JZybnvrpgrNlV8qcN7hLBpMPnjUcKx0Q3BAeBrsWr1tQdlABq1P/7A4c10Zrbkks/1mJRaIH1hA+PVeBlTITCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:09:18.063385Z"},"content_sha256":"11efe3711988148c9d72779c93ae54637b1ab202a9681a9b9fbab84bfefb9a01","schema_version":"1.0","event_id":"sha256:11efe3711988148c9d72779c93ae54637b1ab202a9681a9b9fbab84bfefb9a01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JROOWPOL57TQ5VLWUPSHVTKR7/bundle.json","state_url":"https://pith.science/pith/4JROOWPOL57TQ5VLWUPSHVTKR7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JROOWPOL57TQ5VLWUPSHVTKR7/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-08-11T02:09:18Z","links":{"resolver":"https://pith.science/pith/4JROOWPOL57TQ5VLWUPSHVTKR7","bundle":"https://pith.science/pith/4JROOWPOL57TQ5VLWUPSHVTKR7/bundle.json","state":"https://pith.science/pith/4JROOWPOL57TQ5VLWUPSHVTKR7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JROOWPOL57TQ5VLWUPSHVTKR7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4JROOWPOL57TQ5VLWUPSHVTKR7","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":"03d4cc6a0691ec33c3f03cbd19e6317b37f76d58f02a0a161ffe82e37ccac5ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-19T21:46:44Z","title_canon_sha256":"c89be8eaeabcb8cc2a7713300c3b71c8d306f83eb0dbc6a7d4ce69ac9ac2adbb"},"schema_version":"1.0","source":{"id":"1910.08849","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.08849","created_at":"2026-07-05T01:29:01Z"},{"alias_kind":"arxiv_version","alias_value":"1910.08849v3","created_at":"2026-07-05T01:29:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.08849","created_at":"2026-07-05T01:29:01Z"},{"alias_kind":"pith_short_12","alias_value":"4JROOWPOL57T","created_at":"2026-07-05T01:29:01Z"},{"alias_kind":"pith_short_16","alias_value":"4JROOWPOL57TQ5VL","created_at":"2026-07-05T01:29:01Z"},{"alias_kind":"pith_short_8","alias_value":"4JROOWPO","created_at":"2026-07-05T01:29:01Z"}],"graph_snapshots":[{"event_id":"sha256:11efe3711988148c9d72779c93ae54637b1ab202a9681a9b9fbab84bfefb9a01","target":"graph","created_at":"2026-07-05T01:29:01Z","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/1910.08849/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Carl Feghali, Glenn Hurlbert, Vikram Kamat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-19T21:46:44Z","title":"An Erd\\H{o}s-Ko-Rado Theorem for unions of length 2 paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.08849","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:08f695bca5215461a2de7db2bd2bfc336e6b05fd53e9c7b8efb38ed08e55678b","target":"record","created_at":"2026-07-05T01:29:01Z","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":"03d4cc6a0691ec33c3f03cbd19e6317b37f76d58f02a0a161ffe82e37ccac5ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-19T21:46:44Z","title_canon_sha256":"c89be8eaeabcb8cc2a7713300c3b71c8d306f83eb0dbc6a7d4ce69ac9ac2adbb"},"schema_version":"1.0","source":{"id":"1910.08849","kind":"arxiv","version":3}},"canonical_sha256":"e262e759ee5f7f3876abb51f23d66a8fee933062d1e4f0c7fdac4e90800feb36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e262e759ee5f7f3876abb51f23d66a8fee933062d1e4f0c7fdac4e90800feb36","first_computed_at":"2026-07-05T01:29:01.233509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:29:01.233509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KURufVekICWQsPSag/kNPsDnWafvrADyhmZbX/E7vKElxUDxOnGg5gZPd6nBSF0ukPN2zNJ4dw5uDlHlcYI1BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:29:01.233939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.08849","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08f695bca5215461a2de7db2bd2bfc336e6b05fd53e9c7b8efb38ed08e55678b","sha256:11efe3711988148c9d72779c93ae54637b1ab202a9681a9b9fbab84bfefb9a01"],"state_sha256":"bf128242eacea5511fa9fb3fc6943e677f6d6a3d3ed424a21598d83c98d011ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fBhhqy3n5k5NCBPBTlSjzIvSaSYr/qrOEJ4HKXjq3/NY0fEyRRt842xxMJctmoVnNsv9vPnLAvtQJHRMLEvVDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T02:09:18.071720Z","bundle_sha256":"ce01420a676a3f73bd7bafeb548bff9b98987af98398fdf17ae13bb3ead8cd12"}}