{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YVFX65EUV55Z2S2JTRQXUD3ZEA","short_pith_number":"pith:YVFX65EU","canonical_record":{"source":{"id":"1506.07741","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-25T13:21:14Z","cross_cats_sorted":[],"title_canon_sha256":"468468d1f8d0eba27c9f6b14d6b366592c7873c2635ef91cc338bdb1a564af92","abstract_canon_sha256":"d4da865c3721c3056a29ecde2acd7a18b6f5398769c692aaa1f92838270811dd"},"schema_version":"1.0"},"canonical_sha256":"c54b7f7494af7b9d4b499c617a0f7920380e2118694cccaf8e04074e0611f189","source":{"kind":"arxiv","id":"1506.07741","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07741","created_at":"2026-05-18T01:17:11Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07741v2","created_at":"2026-05-18T01:17:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07741","created_at":"2026-05-18T01:17:11Z"},{"alias_kind":"pith_short_12","alias_value":"YVFX65EUV55Z","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YVFX65EUV55Z2S2J","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YVFX65EU","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YVFX65EUV55Z2S2JTRQXUD3ZEA","target":"record","payload":{"canonical_record":{"source":{"id":"1506.07741","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-25T13:21:14Z","cross_cats_sorted":[],"title_canon_sha256":"468468d1f8d0eba27c9f6b14d6b366592c7873c2635ef91cc338bdb1a564af92","abstract_canon_sha256":"d4da865c3721c3056a29ecde2acd7a18b6f5398769c692aaa1f92838270811dd"},"schema_version":"1.0"},"canonical_sha256":"c54b7f7494af7b9d4b499c617a0f7920380e2118694cccaf8e04074e0611f189","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:11.660456Z","signature_b64":"61ycXCVhrAv8QVgwoEYPROpe9oF/JvAJwiQ77IvZ225rDfwKxZHzVenkKdR5qsdYsS6GXdyAeeD7Q4jTeGQuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c54b7f7494af7b9d4b499c617a0f7920380e2118694cccaf8e04074e0611f189","last_reissued_at":"2026-05-18T01:17:11.659678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:11.659678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.07741","source_version":2,"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-05-18T01:17:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vY0PF/8IQppXZqMAooXMzMET9mir58eQcqisGcYLsO/WeVWZ1Fpvc+Apg7SgsQ2NOs0sarY7uGj+xLsvo7HLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:41:09.178904Z"},"content_sha256":"bae94a33f1e471066daea0b797e8760efe3db5addb60625396a4767670be7ffc","schema_version":"1.0","event_id":"sha256:bae94a33f1e471066daea0b797e8760efe3db5addb60625396a4767670be7ffc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YVFX65EUV55Z2S2JTRQXUD3ZEA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Erd\\H{o}s-Ko-Rado Theorems for a Family of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Feghali, Daniel Thomas, Matthew Johnson","submitted_at":"2015-06-25T13:21:14Z","abstract_excerpt":"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$, let $\\mathcal{I}^{(r)}_v(G)$ denote the family of independent sets of size $r$ that contain~$v$. This family is called an $r$-star and $v$ is the centre of the star. Then $G$ is said to be $r$-EKR if no pairwise intersecting subfamily of $\\mathcal{I}^{(r)}(G)$ is bigger than the largest $r$-star, and if every maximum size pairwise intersecting subfamily of $\\mathcal{I}^{(r)}(G)$ is an $r$-star, then $G$ is said to be strictly $r$-EKR. Let $\\m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07741","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":""},"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-05-18T01:17:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OEe8/Mgh223qrUtdscZ16HTBo7KcYRn6ZGnCYG+fHSmRWaJqJxIWlkfynvFNRboa2flxuk0m0NoCy4QECt3rCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:41:09.179305Z"},"content_sha256":"665b353c74770f799a4dc7b8d20d34112c260fc63165000be51fefbd3a4732fd","schema_version":"1.0","event_id":"sha256:665b353c74770f799a4dc7b8d20d34112c260fc63165000be51fefbd3a4732fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YVFX65EUV55Z2S2JTRQXUD3ZEA/bundle.json","state_url":"https://pith.science/pith/YVFX65EUV55Z2S2JTRQXUD3ZEA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YVFX65EUV55Z2S2JTRQXUD3ZEA/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-05-25T11:41:09Z","links":{"resolver":"https://pith.science/pith/YVFX65EUV55Z2S2JTRQXUD3ZEA","bundle":"https://pith.science/pith/YVFX65EUV55Z2S2JTRQXUD3ZEA/bundle.json","state":"https://pith.science/pith/YVFX65EUV55Z2S2JTRQXUD3ZEA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YVFX65EUV55Z2S2JTRQXUD3ZEA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YVFX65EUV55Z2S2JTRQXUD3ZEA","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":"d4da865c3721c3056a29ecde2acd7a18b6f5398769c692aaa1f92838270811dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-25T13:21:14Z","title_canon_sha256":"468468d1f8d0eba27c9f6b14d6b366592c7873c2635ef91cc338bdb1a564af92"},"schema_version":"1.0","source":{"id":"1506.07741","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07741","created_at":"2026-05-18T01:17:11Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07741v2","created_at":"2026-05-18T01:17:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07741","created_at":"2026-05-18T01:17:11Z"},{"alias_kind":"pith_short_12","alias_value":"YVFX65EUV55Z","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YVFX65EUV55Z2S2J","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YVFX65EU","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:665b353c74770f799a4dc7b8d20d34112c260fc63165000be51fefbd3a4732fd","target":"graph","created_at":"2026-05-18T01:17:11Z","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"},"paper":{"abstract_excerpt":"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$, let $\\mathcal{I}^{(r)}_v(G)$ denote the family of independent sets of size $r$ that contain~$v$. This family is called an $r$-star and $v$ is the centre of the star. Then $G$ is said to be $r$-EKR if no pairwise intersecting subfamily of $\\mathcal{I}^{(r)}(G)$ is bigger than the largest $r$-star, and if every maximum size pairwise intersecting subfamily of $\\mathcal{I}^{(r)}(G)$ is an $r$-star, then $G$ is said to be strictly $r$-EKR. Let $\\m","authors_text":"Carl Feghali, Daniel Thomas, Matthew Johnson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-25T13:21:14Z","title":"Erd\\H{o}s-Ko-Rado Theorems for a Family of Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07741","kind":"arxiv","version":2},"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:bae94a33f1e471066daea0b797e8760efe3db5addb60625396a4767670be7ffc","target":"record","created_at":"2026-05-18T01:17:11Z","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":"d4da865c3721c3056a29ecde2acd7a18b6f5398769c692aaa1f92838270811dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-25T13:21:14Z","title_canon_sha256":"468468d1f8d0eba27c9f6b14d6b366592c7873c2635ef91cc338bdb1a564af92"},"schema_version":"1.0","source":{"id":"1506.07741","kind":"arxiv","version":2}},"canonical_sha256":"c54b7f7494af7b9d4b499c617a0f7920380e2118694cccaf8e04074e0611f189","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c54b7f7494af7b9d4b499c617a0f7920380e2118694cccaf8e04074e0611f189","first_computed_at":"2026-05-18T01:17:11.659678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:11.659678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"61ycXCVhrAv8QVgwoEYPROpe9oF/JvAJwiQ77IvZ225rDfwKxZHzVenkKdR5qsdYsS6GXdyAeeD7Q4jTeGQuCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:11.660456Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.07741","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bae94a33f1e471066daea0b797e8760efe3db5addb60625396a4767670be7ffc","sha256:665b353c74770f799a4dc7b8d20d34112c260fc63165000be51fefbd3a4732fd"],"state_sha256":"92fb03c3a416ab010af079f68d1f3b86a8d449c09dc36997379213a9925bfa3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oASkkwcbXCeaH4WPb1oyNOxIY39AJx+R7Pxy/35XdwSEnx+PPFABUB7ljVoH74sOzzNU6QQD21pquEQvNwlsBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:41:09.181964Z","bundle_sha256":"64b7d8b3c45caf6a0689e126c9822d020f8288b61ec7be9672715d057f3997cd"}}