{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NRH4SYR6JGGP5X5652ZNYH6YPF","short_pith_number":"pith:NRH4SYR6","schema_version":"1.0","canonical_sha256":"6c4fc9623e498cfedfbeeeb2dc1fd8796cedafde10c8c8f5cb7ad588cd0432fb","source":{"kind":"arxiv","id":"1509.03072","version":6},"attestation_state":"computed","paper":{"title":"Regular Graphs with Forbidden Subgraphs of $K_n$ with $k$ Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tuvi Etzion","submitted_at":"2015-09-10T09:55:41Z","abstract_excerpt":"In this paper we raise a variant of a classic problem in extremal graph theory, which is motivated by a design of fractional repetition codes, a model in distributed storage systems. For any feasible positive integers $d\\geq 3$, $n \\geq 3$, and $k$, where $n-1 \\leq k \\leq \\binom{n}{2}$, what is the minimum possible number of vertices in a $d$-regular undirected graph whose subgraphs with $n$ vertices contain at most $k$ edges? The goal of this paper is to give the exact number of vertices for each instance of the problem and also to provide some bounds for general values of $n$, $d$, and $k$. "},"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":"1509.03072","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-10T09:55:41Z","cross_cats_sorted":[],"title_canon_sha256":"6665f0a57bef7725682a572d9adb414162c4f3e217d8ace9ec0b61015793c422","abstract_canon_sha256":"0a2e78fd1b390ceef65d4f285b34361311a23f70b464726c4ba286816d6908d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:12.661518Z","signature_b64":"9b51kMt1u8EyH+/Q2OwgI1Cpgs7VSpWDVALV/GECs7diSPLXfg2BQPhUa1jKD963THEQcLbOa8RtzYlY6KCoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c4fc9623e498cfedfbeeeb2dc1fd8796cedafde10c8c8f5cb7ad588cd0432fb","last_reissued_at":"2026-05-18T01:09:12.660775Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:12.660775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regular Graphs with Forbidden Subgraphs of $K_n$ with $k$ Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tuvi Etzion","submitted_at":"2015-09-10T09:55:41Z","abstract_excerpt":"In this paper we raise a variant of a classic problem in extremal graph theory, which is motivated by a design of fractional repetition codes, a model in distributed storage systems. For any feasible positive integers $d\\geq 3$, $n \\geq 3$, and $k$, where $n-1 \\leq k \\leq \\binom{n}{2}$, what is the minimum possible number of vertices in a $d$-regular undirected graph whose subgraphs with $n$ vertices contain at most $k$ edges? The goal of this paper is to give the exact number of vertices for each instance of the problem and also to provide some bounds for general values of $n$, $d$, and $k$. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03072","kind":"arxiv","version":6},"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":"1509.03072","created_at":"2026-05-18T01:09:12.660882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.03072v6","created_at":"2026-05-18T01:09:12.660882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03072","created_at":"2026-05-18T01:09:12.660882+00:00"},{"alias_kind":"pith_short_12","alias_value":"NRH4SYR6JGGP","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NRH4SYR6JGGP5X56","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NRH4SYR6","created_at":"2026-05-18T12:29:34.919912+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/NRH4SYR6JGGP5X5652ZNYH6YPF","json":"https://pith.science/pith/NRH4SYR6JGGP5X5652ZNYH6YPF.json","graph_json":"https://pith.science/api/pith-number/NRH4SYR6JGGP5X5652ZNYH6YPF/graph.json","events_json":"https://pith.science/api/pith-number/NRH4SYR6JGGP5X5652ZNYH6YPF/events.json","paper":"https://pith.science/paper/NRH4SYR6"},"agent_actions":{"view_html":"https://pith.science/pith/NRH4SYR6JGGP5X5652ZNYH6YPF","download_json":"https://pith.science/pith/NRH4SYR6JGGP5X5652ZNYH6YPF.json","view_paper":"https://pith.science/paper/NRH4SYR6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.03072&json=true","fetch_graph":"https://pith.science/api/pith-number/NRH4SYR6JGGP5X5652ZNYH6YPF/graph.json","fetch_events":"https://pith.science/api/pith-number/NRH4SYR6JGGP5X5652ZNYH6YPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NRH4SYR6JGGP5X5652ZNYH6YPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NRH4SYR6JGGP5X5652ZNYH6YPF/action/storage_attestation","attest_author":"https://pith.science/pith/NRH4SYR6JGGP5X5652ZNYH6YPF/action/author_attestation","sign_citation":"https://pith.science/pith/NRH4SYR6JGGP5X5652ZNYH6YPF/action/citation_signature","submit_replication":"https://pith.science/pith/NRH4SYR6JGGP5X5652ZNYH6YPF/action/replication_record"}},"created_at":"2026-05-18T01:09:12.660882+00:00","updated_at":"2026-05-18T01:09:12.660882+00:00"}