{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:EW4YPIIZD6EU2UM5EMLSGL25LT","short_pith_number":"pith:EW4YPIIZ","schema_version":"1.0","canonical_sha256":"25b987a1191f894d519d2317232f5d5cf6742e4b7b613fda2b3dc829f63b9764","source":{"kind":"arxiv","id":"1010.0947","version":1},"attestation_state":"computed","paper":{"title":"On cross-intersecting families of independent sets in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vikram Kamat","submitted_at":"2010-10-05T17:16:19Z","abstract_excerpt":"Let A_1,...,A_k be a collection of families of subsets of an n-element set. We say that this collection is cross-intersecting if for any i,j in [k] with i not equal to j, A in A_i and B in A_j implies that the intersection of A and B is nonempty. We consider a theorem of Hilton which gives a best possible upper bound on the sum of the cardinalities of uniform cross-intersecting subfamilies. We formulate a graph-theoretic analogue of Hilton's cross-intersection theorem, similar to the one developed by Holroyd, Spencer and Talbot for the Erdos-Ko-Rado theorem. In particular we build on a result "},"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":"1010.0947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-05T17:16:19Z","cross_cats_sorted":[],"title_canon_sha256":"74713343ac1c7c6034d58fd1a6de2ec78da1473f7672d7c728f28eb70a4f3df5","abstract_canon_sha256":"96a3d0c77154a0c55b983ffd344ca95fb5bfe6894607b4d81586171cfd77dd60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:50.621106Z","signature_b64":"uhOdCXvm6v0faMZNIPhYwAM2j3GkMvysquENHtmPvFK9QDTJBIKQc6vvWMfuQbiaQOrIU2WyZs5c1wkuHsyCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25b987a1191f894d519d2317232f5d5cf6742e4b7b613fda2b3dc829f63b9764","last_reissued_at":"2026-05-18T04:39:50.620596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:50.620596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On cross-intersecting families of independent sets in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vikram Kamat","submitted_at":"2010-10-05T17:16:19Z","abstract_excerpt":"Let A_1,...,A_k be a collection of families of subsets of an n-element set. We say that this collection is cross-intersecting if for any i,j in [k] with i not equal to j, A in A_i and B in A_j implies that the intersection of A and B is nonempty. We consider a theorem of Hilton which gives a best possible upper bound on the sum of the cardinalities of uniform cross-intersecting subfamilies. We formulate a graph-theoretic analogue of Hilton's cross-intersection theorem, similar to the one developed by Holroyd, Spencer and Talbot for the Erdos-Ko-Rado theorem. In particular we build on a result "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0947","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":""},"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":"1010.0947","created_at":"2026-05-18T04:39:50.620672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.0947v1","created_at":"2026-05-18T04:39:50.620672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0947","created_at":"2026-05-18T04:39:50.620672+00:00"},{"alias_kind":"pith_short_12","alias_value":"EW4YPIIZD6EU","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"EW4YPIIZD6EU2UM5","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"EW4YPIIZ","created_at":"2026-05-18T12:26:06.534383+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/EW4YPIIZD6EU2UM5EMLSGL25LT","json":"https://pith.science/pith/EW4YPIIZD6EU2UM5EMLSGL25LT.json","graph_json":"https://pith.science/api/pith-number/EW4YPIIZD6EU2UM5EMLSGL25LT/graph.json","events_json":"https://pith.science/api/pith-number/EW4YPIIZD6EU2UM5EMLSGL25LT/events.json","paper":"https://pith.science/paper/EW4YPIIZ"},"agent_actions":{"view_html":"https://pith.science/pith/EW4YPIIZD6EU2UM5EMLSGL25LT","download_json":"https://pith.science/pith/EW4YPIIZD6EU2UM5EMLSGL25LT.json","view_paper":"https://pith.science/paper/EW4YPIIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.0947&json=true","fetch_graph":"https://pith.science/api/pith-number/EW4YPIIZD6EU2UM5EMLSGL25LT/graph.json","fetch_events":"https://pith.science/api/pith-number/EW4YPIIZD6EU2UM5EMLSGL25LT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EW4YPIIZD6EU2UM5EMLSGL25LT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EW4YPIIZD6EU2UM5EMLSGL25LT/action/storage_attestation","attest_author":"https://pith.science/pith/EW4YPIIZD6EU2UM5EMLSGL25LT/action/author_attestation","sign_citation":"https://pith.science/pith/EW4YPIIZD6EU2UM5EMLSGL25LT/action/citation_signature","submit_replication":"https://pith.science/pith/EW4YPIIZD6EU2UM5EMLSGL25LT/action/replication_record"}},"created_at":"2026-05-18T04:39:50.620672+00:00","updated_at":"2026-05-18T04:39:50.620672+00:00"}