{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CJQLF6ZIV7GVSNSE6ORU27YCTR","short_pith_number":"pith:CJQLF6ZI","schema_version":"1.0","canonical_sha256":"1260b2fb28afcd593644f3a34d7f029c426063cbbbff5883a4acd7a251d83925","source":{"kind":"arxiv","id":"1908.08825","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.08825","created_at":"2026-07-04T23:59:24.344379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.08825v1","created_at":"2026-07-04T23:59:24.344379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08825","created_at":"2026-07-04T23:59:24.344379+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJQLF6ZIV7GV","created_at":"2026-07-04T23:59:24.344379+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJQLF6ZIV7GVSNSE","created_at":"2026-07-04T23:59:24.344379+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJQLF6ZI","created_at":"2026-07-04T23:59:24.344379+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/CJQLF6ZIV7GVSNSE6ORU27YCTR","json":"https://pith.science/pith/CJQLF6ZIV7GVSNSE6ORU27YCTR.json","graph_json":"https://pith.science/api/pith-number/CJQLF6ZIV7GVSNSE6ORU27YCTR/graph.json","events_json":"https://pith.science/api/pith-number/CJQLF6ZIV7GVSNSE6ORU27YCTR/events.json","paper":"https://pith.science/paper/CJQLF6ZI"},"agent_actions":{"view_html":"https://pith.science/pith/CJQLF6ZIV7GVSNSE6ORU27YCTR","download_json":"https://pith.science/pith/CJQLF6ZIV7GVSNSE6ORU27YCTR.json","view_paper":"https://pith.science/paper/CJQLF6ZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.08825&json=true","fetch_graph":"https://pith.science/api/pith-number/CJQLF6ZIV7GVSNSE6ORU27YCTR/graph.json","fetch_events":"https://pith.science/api/pith-number/CJQLF6ZIV7GVSNSE6ORU27YCTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJQLF6ZIV7GVSNSE6ORU27YCTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJQLF6ZIV7GVSNSE6ORU27YCTR/action/storage_attestation","attest_author":"https://pith.science/pith/CJQLF6ZIV7GVSNSE6ORU27YCTR/action/author_attestation","sign_citation":"https://pith.science/pith/CJQLF6ZIV7GVSNSE6ORU27YCTR/action/citation_signature","submit_replication":"https://pith.science/pith/CJQLF6ZIV7GVSNSE6ORU27YCTR/action/replication_record"}},"created_at":"2026-07-04T23:59:24.344379+00:00","updated_at":"2026-07-04T23:59:24.344379+00:00"}