{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CJQLF6ZIV7GVSNSE6ORU27YCTR","short_pith_number":"pith:CJQLF6ZI","canonical_record":{"source":{"id":"1908.08825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-23T13:49:51Z","cross_cats_sorted":[],"title_canon_sha256":"06742c9f6f8ca115648b5834e9c39359d6b2d5193a1b6863699d197cf4a3b365","abstract_canon_sha256":"db9ed2d874e71d18850c4c6f46335e6d1386cbfc400e556559bb9b7b2d24a7ba"},"schema_version":"1.0"},"canonical_sha256":"1260b2fb28afcd593644f3a34d7f029c426063cbbbff5883a4acd7a251d83925","source":{"kind":"arxiv","id":"1908.08825","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08825","created_at":"2026-07-04T23:59:24Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08825v1","created_at":"2026-07-04T23:59:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08825","created_at":"2026-07-04T23:59:24Z"},{"alias_kind":"pith_short_12","alias_value":"CJQLF6ZIV7GV","created_at":"2026-07-04T23:59:24Z"},{"alias_kind":"pith_short_16","alias_value":"CJQLF6ZIV7GVSNSE","created_at":"2026-07-04T23:59:24Z"},{"alias_kind":"pith_short_8","alias_value":"CJQLF6ZI","created_at":"2026-07-04T23:59:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CJQLF6ZIV7GVSNSE6ORU27YCTR","target":"record","payload":{"canonical_record":{"source":{"id":"1908.08825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-23T13:49:51Z","cross_cats_sorted":[],"title_canon_sha256":"06742c9f6f8ca115648b5834e9c39359d6b2d5193a1b6863699d197cf4a3b365","abstract_canon_sha256":"db9ed2d874e71d18850c4c6f46335e6d1386cbfc400e556559bb9b7b2d24a7ba"},"schema_version":"1.0"},"canonical_sha256":"1260b2fb28afcd593644f3a34d7f029c426063cbbbff5883a4acd7a251d83925","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:24.344778Z","signature_b64":"oB8sVSGS2wMoBrxQTM3brPmAvMyQsbCnJsKPH40uAIQiTQhMVjgWXE22kKt4JXdVzjFbE3l6+mLFR4gUEHm7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1260b2fb28afcd593644f3a34d7f029c426063cbbbff5883a4acd7a251d83925","last_reissued_at":"2026-07-04T23:59:24.344322Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:24.344322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.08825","source_version":1,"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-04T23:59:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"itNJhxc0cT7x/0L2z6HEXsW5m7L1ih+ikJcSEsh6U67uF/GVjL0AQ2Sa7EQAKBdU6L+a/CKRVD0vQ9lXyYqgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T22:41:16.255715Z"},"content_sha256":"208a6d9baf6c85a1aca357e7fb98c8e4ee912b60976d67470030cc09a2cf0475","schema_version":"1.0","event_id":"sha256:208a6d9baf6c85a1aca357e7fb98c8e4ee912b60976d67470030cc09a2cf0475"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CJQLF6ZIV7GVSNSE6ORU27YCTR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Hilton-Spencer intersection theorems for unions of cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Feghali, Peter Borg","submitted_at":"2019-08-23T13:49:51Z","abstract_excerpt":"A family $\\mathcal{A}$ of sets is said to be intersecting if every two sets in $\\mathcal{A}$ intersect. An intersecting family is said to be \\emph{trivial} it its sets have a common element. A graph $G$ is said to be $r$-EKR if at least one of the largest intersecting families of independent $r$-element sets of $G$ is trivial. Let $\\alpha(G)$ and $\\omega(G)$ denote the independence number and the clique number of $G$, respectively. Hilton and Spencer recently showed that if $G$ is the vertex-disjoint union of a cycle ${_*C}$ raised to the power $k^*$ and $s$ cycles ${_1C}, \\dots, {_sC}$ raised"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08825","kind":"arxiv","version":1},"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/1908.08825/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-04T23:59:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S97rjfK9Bea7EtCFOjbWAagcVjzW/UP/JwzFsx466eGtVHv8MjBcM4zTvucJzVUUpbgxJBx8zKFsEsl4LNejCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T22:41:16.256816Z"},"content_sha256":"d3b450548a9e14622a0d40019012745727205021e3fc7bae31ef7b0d3b2e9c44","schema_version":"1.0","event_id":"sha256:d3b450548a9e14622a0d40019012745727205021e3fc7bae31ef7b0d3b2e9c44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJQLF6ZIV7GVSNSE6ORU27YCTR/bundle.json","state_url":"https://pith.science/pith/CJQLF6ZIV7GVSNSE6ORU27YCTR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJQLF6ZIV7GVSNSE6ORU27YCTR/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-10T22:41:16Z","links":{"resolver":"https://pith.science/pith/CJQLF6ZIV7GVSNSE6ORU27YCTR","bundle":"https://pith.science/pith/CJQLF6ZIV7GVSNSE6ORU27YCTR/bundle.json","state":"https://pith.science/pith/CJQLF6ZIV7GVSNSE6ORU27YCTR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJQLF6ZIV7GVSNSE6ORU27YCTR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CJQLF6ZIV7GVSNSE6ORU27YCTR","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":"db9ed2d874e71d18850c4c6f46335e6d1386cbfc400e556559bb9b7b2d24a7ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-23T13:49:51Z","title_canon_sha256":"06742c9f6f8ca115648b5834e9c39359d6b2d5193a1b6863699d197cf4a3b365"},"schema_version":"1.0","source":{"id":"1908.08825","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08825","created_at":"2026-07-04T23:59:24Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08825v1","created_at":"2026-07-04T23:59:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08825","created_at":"2026-07-04T23:59:24Z"},{"alias_kind":"pith_short_12","alias_value":"CJQLF6ZIV7GV","created_at":"2026-07-04T23:59:24Z"},{"alias_kind":"pith_short_16","alias_value":"CJQLF6ZIV7GVSNSE","created_at":"2026-07-04T23:59:24Z"},{"alias_kind":"pith_short_8","alias_value":"CJQLF6ZI","created_at":"2026-07-04T23:59:24Z"}],"graph_snapshots":[{"event_id":"sha256:d3b450548a9e14622a0d40019012745727205021e3fc7bae31ef7b0d3b2e9c44","target":"graph","created_at":"2026-07-04T23:59:24Z","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/1908.08825/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A family $\\mathcal{A}$ of sets is said to be intersecting if every two sets in $\\mathcal{A}$ intersect. An intersecting family is said to be \\emph{trivial} it its sets have a common element. A graph $G$ is said to be $r$-EKR if at least one of the largest intersecting families of independent $r$-element sets of $G$ is trivial. Let $\\alpha(G)$ and $\\omega(G)$ denote the independence number and the clique number of $G$, respectively. Hilton and Spencer recently showed that if $G$ is the vertex-disjoint union of a cycle ${_*C}$ raised to the power $k^*$ and $s$ cycles ${_1C}, \\dots, {_sC}$ raised","authors_text":"Carl Feghali, Peter Borg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-23T13:49:51Z","title":"On the Hilton-Spencer intersection theorems for unions of cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08825","kind":"arxiv","version":1},"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:208a6d9baf6c85a1aca357e7fb98c8e4ee912b60976d67470030cc09a2cf0475","target":"record","created_at":"2026-07-04T23:59:24Z","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":"db9ed2d874e71d18850c4c6f46335e6d1386cbfc400e556559bb9b7b2d24a7ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-23T13:49:51Z","title_canon_sha256":"06742c9f6f8ca115648b5834e9c39359d6b2d5193a1b6863699d197cf4a3b365"},"schema_version":"1.0","source":{"id":"1908.08825","kind":"arxiv","version":1}},"canonical_sha256":"1260b2fb28afcd593644f3a34d7f029c426063cbbbff5883a4acd7a251d83925","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1260b2fb28afcd593644f3a34d7f029c426063cbbbff5883a4acd7a251d83925","first_computed_at":"2026-07-04T23:59:24.344322Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:24.344322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oB8sVSGS2wMoBrxQTM3brPmAvMyQsbCnJsKPH40uAIQiTQhMVjgWXE22kKt4JXdVzjFbE3l6+mLFR4gUEHm7Ag==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:24.344778Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.08825","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:208a6d9baf6c85a1aca357e7fb98c8e4ee912b60976d67470030cc09a2cf0475","sha256:d3b450548a9e14622a0d40019012745727205021e3fc7bae31ef7b0d3b2e9c44"],"state_sha256":"b952ff28836d8ffce1e644e1759b8326a3762077abb2cc495a9aa77d89538bcd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E384Hy6XoGqeSPVl8JWqC6e6q5U7/0FYXZNSus3uWAkPWMAA1gA8vd0rqpEIF/ySLr3O+ICY9RIIcFlSGwxTDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T22:41:16.264206Z","bundle_sha256":"58977ab223b7f64281053d4b2c04f898e9b32efab951e93414da0d5113d1cc0a"}}