{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:47OD3IZSDCM6XVM74M2MQPWIUO","short_pith_number":"pith:47OD3IZS","schema_version":"1.0","canonical_sha256":"e7dc3da3321899ebd59fe334c83ec8a3a3ec696fd6cc18d4f3ad547b9002a79f","source":{"kind":"arxiv","id":"1212.1071","version":2},"attestation_state":"computed","paper":{"title":"A discrete isodiametric result: the Erd\\H{o}s-Ko-Rado theorem for multisets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D\\'aniel Gerbner, M\\'at\\'e Vizer, Zolt\\'an F\\\"uredi","submitted_at":"2012-12-05T16:01:02Z","abstract_excerpt":"There are many generalizations of the Erd\\H{o}s-Ko-Rado theorem. We give new results (and problems) concerning families of $t$-intersecting $k$-element multisets of an $n$-set and point out connections to coding theory and classical geometry. We establish the conjecture that for $n \\geq t(k-t)+2$ such a family can have at most ${n+k-t-1\\choose k-t}$ members."},"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":"1212.1071","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-05T16:01:02Z","cross_cats_sorted":[],"title_canon_sha256":"c489487b7f0da9e095353ee578110e01ea0b2fb800c28dde70033bd034b9a3b4","abstract_canon_sha256":"996020fa268a8f645efea07320589d9e686b54a42675620a3ac049477c53e1f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:52.147856Z","signature_b64":"qMtCvEwo6gIIrMvfTV7tPrspsXAGDriOkZ4VeWHFDNd8DvGVJnjefr3gm36+4EZFq4aJXcyOOSXuEsc/9ZkqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7dc3da3321899ebd59fe334c83ec8a3a3ec696fd6cc18d4f3ad547b9002a79f","last_reissued_at":"2026-05-18T02:56:52.147438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:52.147438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A discrete isodiametric result: the Erd\\H{o}s-Ko-Rado theorem for multisets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D\\'aniel Gerbner, M\\'at\\'e Vizer, Zolt\\'an F\\\"uredi","submitted_at":"2012-12-05T16:01:02Z","abstract_excerpt":"There are many generalizations of the Erd\\H{o}s-Ko-Rado theorem. We give new results (and problems) concerning families of $t$-intersecting $k$-element multisets of an $n$-set and point out connections to coding theory and classical geometry. We establish the conjecture that for $n \\geq t(k-t)+2$ such a family can have at most ${n+k-t-1\\choose k-t}$ members."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1071","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.1071","created_at":"2026-05-18T02:56:52.147503+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.1071v2","created_at":"2026-05-18T02:56:52.147503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1071","created_at":"2026-05-18T02:56:52.147503+00:00"},{"alias_kind":"pith_short_12","alias_value":"47OD3IZSDCM6","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"47OD3IZSDCM6XVM7","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"47OD3IZS","created_at":"2026-05-18T12:26:53.410803+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/47OD3IZSDCM6XVM74M2MQPWIUO","json":"https://pith.science/pith/47OD3IZSDCM6XVM74M2MQPWIUO.json","graph_json":"https://pith.science/api/pith-number/47OD3IZSDCM6XVM74M2MQPWIUO/graph.json","events_json":"https://pith.science/api/pith-number/47OD3IZSDCM6XVM74M2MQPWIUO/events.json","paper":"https://pith.science/paper/47OD3IZS"},"agent_actions":{"view_html":"https://pith.science/pith/47OD3IZSDCM6XVM74M2MQPWIUO","download_json":"https://pith.science/pith/47OD3IZSDCM6XVM74M2MQPWIUO.json","view_paper":"https://pith.science/paper/47OD3IZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.1071&json=true","fetch_graph":"https://pith.science/api/pith-number/47OD3IZSDCM6XVM74M2MQPWIUO/graph.json","fetch_events":"https://pith.science/api/pith-number/47OD3IZSDCM6XVM74M2MQPWIUO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/47OD3IZSDCM6XVM74M2MQPWIUO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/47OD3IZSDCM6XVM74M2MQPWIUO/action/storage_attestation","attest_author":"https://pith.science/pith/47OD3IZSDCM6XVM74M2MQPWIUO/action/author_attestation","sign_citation":"https://pith.science/pith/47OD3IZSDCM6XVM74M2MQPWIUO/action/citation_signature","submit_replication":"https://pith.science/pith/47OD3IZSDCM6XVM74M2MQPWIUO/action/replication_record"}},"created_at":"2026-05-18T02:56:52.147503+00:00","updated_at":"2026-05-18T02:56:52.147503+00:00"}