{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZSEM74RZYX4UNFFIHDWEWMVURQ","short_pith_number":"pith:ZSEM74RZ","schema_version":"1.0","canonical_sha256":"cc88cff239c5f94694a838ec4b32b48c06adccd97db5c34ca9c573ee1d6a270a","source":{"kind":"arxiv","id":"1709.10462","version":3},"attestation_state":"computed","paper":{"title":"Regular Intersecting Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Ferdinand Ihringer","submitted_at":"2017-09-29T15:48:06Z","abstract_excerpt":"We call a family of sets intersecting, if any two sets in the family intersect. In this paper we investigate intersecting families $\\mathcal{F}$ of $k$-element subsets of $[n]:=\\{1,\\ldots, n\\},$ such that every element of $[n]$ lies in the same (or approximately the same) number of members of $\\mathcal{F}$. In particular, we show that we can guarantee $|\\mathcal{F}| = o({n-1\\choose k-1})$ if and only if $k=o(n)$."},"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":"1709.10462","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-29T15:48:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c112fe0dbbd724f94a0cea047ef73b7e6b72615cb585c30adf4fca3847f1aaeb","abstract_canon_sha256":"43e1cb95ff0fe41f8b7de0671b5b4305b99be473133a51d7f459a4f1ef66db05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:56.566351Z","signature_b64":"M6qVNSKCCuoPtH7f78ttnBVXby1uZobfLhb3oW+ZwLhV1gsMImDbsIZT02sLq0LkqD5Sm6hH7xmxXP6YSLpEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc88cff239c5f94694a838ec4b32b48c06adccd97db5c34ca9c573ee1d6a270a","last_reissued_at":"2026-05-17T23:41:56.565529Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:56.565529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regular Intersecting Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Ferdinand Ihringer","submitted_at":"2017-09-29T15:48:06Z","abstract_excerpt":"We call a family of sets intersecting, if any two sets in the family intersect. In this paper we investigate intersecting families $\\mathcal{F}$ of $k$-element subsets of $[n]:=\\{1,\\ldots, n\\},$ such that every element of $[n]$ lies in the same (or approximately the same) number of members of $\\mathcal{F}$. In particular, we show that we can guarantee $|\\mathcal{F}| = o({n-1\\choose k-1})$ if and only if $k=o(n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10462","kind":"arxiv","version":3},"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":"1709.10462","created_at":"2026-05-17T23:41:56.565647+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.10462v3","created_at":"2026-05-17T23:41:56.565647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10462","created_at":"2026-05-17T23:41:56.565647+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZSEM74RZYX4U","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZSEM74RZYX4UNFFI","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZSEM74RZ","created_at":"2026-05-18T12:31:59.375834+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/ZSEM74RZYX4UNFFIHDWEWMVURQ","json":"https://pith.science/pith/ZSEM74RZYX4UNFFIHDWEWMVURQ.json","graph_json":"https://pith.science/api/pith-number/ZSEM74RZYX4UNFFIHDWEWMVURQ/graph.json","events_json":"https://pith.science/api/pith-number/ZSEM74RZYX4UNFFIHDWEWMVURQ/events.json","paper":"https://pith.science/paper/ZSEM74RZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZSEM74RZYX4UNFFIHDWEWMVURQ","download_json":"https://pith.science/pith/ZSEM74RZYX4UNFFIHDWEWMVURQ.json","view_paper":"https://pith.science/paper/ZSEM74RZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.10462&json=true","fetch_graph":"https://pith.science/api/pith-number/ZSEM74RZYX4UNFFIHDWEWMVURQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZSEM74RZYX4UNFFIHDWEWMVURQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZSEM74RZYX4UNFFIHDWEWMVURQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZSEM74RZYX4UNFFIHDWEWMVURQ/action/storage_attestation","attest_author":"https://pith.science/pith/ZSEM74RZYX4UNFFIHDWEWMVURQ/action/author_attestation","sign_citation":"https://pith.science/pith/ZSEM74RZYX4UNFFIHDWEWMVURQ/action/citation_signature","submit_replication":"https://pith.science/pith/ZSEM74RZYX4UNFFIHDWEWMVURQ/action/replication_record"}},"created_at":"2026-05-17T23:41:56.565647+00:00","updated_at":"2026-05-17T23:41:56.565647+00:00"}