{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NRH4SYR6JGGP5X5652ZNYH6YPF","short_pith_number":"pith:NRH4SYR6","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"},"canonical_sha256":"6c4fc9623e498cfedfbeeeb2dc1fd8796cedafde10c8c8f5cb7ad588cd0432fb","source":{"kind":"arxiv","id":"1509.03072","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03072","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03072v6","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03072","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"NRH4SYR6JGGP","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NRH4SYR6JGGP5X56","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NRH4SYR6","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NRH4SYR6JGGP5X5652ZNYH6YPF","target":"record","payload":{"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"},"canonical_sha256":"6c4fc9623e498cfedfbeeeb2dc1fd8796cedafde10c8c8f5cb7ad588cd0432fb","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"},"source_kind":"arxiv","source_id":"1509.03072","source_version":6,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QCixeCaokpkJYR5DdGzuugOqsqldwamdki4mudpsDQg/1cUF3KyiZkFiCV1Ar1d9E5T0zdVGQEFnE4hMgpMKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:00:20.338725Z"},"content_sha256":"20128233dea37decfd8c22be0a2aac0988742cb3b9406af26137211de4b12cde","schema_version":"1.0","event_id":"sha256:20128233dea37decfd8c22be0a2aac0988742cb3b9406af26137211de4b12cde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NRH4SYR6JGGP5X5652ZNYH6YPF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7bfHMZFCDmpJ8j1JNfmCICzA3cR++gHsBUYFlW9FnojFu6svC1TW4c7zpqoyEnCBy+VBnq2i0YMfj8z5Q5vtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:00:20.339073Z"},"content_sha256":"2034816c48f4852b44a2e2f3eb402863376238b26fe0bf27cb7290e4e63f0825","schema_version":"1.0","event_id":"sha256:2034816c48f4852b44a2e2f3eb402863376238b26fe0bf27cb7290e4e63f0825"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NRH4SYR6JGGP5X5652ZNYH6YPF/bundle.json","state_url":"https://pith.science/pith/NRH4SYR6JGGP5X5652ZNYH6YPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NRH4SYR6JGGP5X5652ZNYH6YPF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T21:00:20Z","links":{"resolver":"https://pith.science/pith/NRH4SYR6JGGP5X5652ZNYH6YPF","bundle":"https://pith.science/pith/NRH4SYR6JGGP5X5652ZNYH6YPF/bundle.json","state":"https://pith.science/pith/NRH4SYR6JGGP5X5652ZNYH6YPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NRH4SYR6JGGP5X5652ZNYH6YPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NRH4SYR6JGGP5X5652ZNYH6YPF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0a2e78fd1b390ceef65d4f285b34361311a23f70b464726c4ba286816d6908d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-10T09:55:41Z","title_canon_sha256":"6665f0a57bef7725682a572d9adb414162c4f3e217d8ace9ec0b61015793c422"},"schema_version":"1.0","source":{"id":"1509.03072","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03072","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03072v6","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03072","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"NRH4SYR6JGGP","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NRH4SYR6JGGP5X56","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NRH4SYR6","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:2034816c48f4852b44a2e2f3eb402863376238b26fe0bf27cb7290e4e63f0825","target":"graph","created_at":"2026-05-18T01:09:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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$. ","authors_text":"Tuvi Etzion","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-10T09:55:41Z","title":"Regular Graphs with Forbidden Subgraphs of $K_n$ with $k$ Edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03072","kind":"arxiv","version":6},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:20128233dea37decfd8c22be0a2aac0988742cb3b9406af26137211de4b12cde","target":"record","created_at":"2026-05-18T01:09:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0a2e78fd1b390ceef65d4f285b34361311a23f70b464726c4ba286816d6908d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-10T09:55:41Z","title_canon_sha256":"6665f0a57bef7725682a572d9adb414162c4f3e217d8ace9ec0b61015793c422"},"schema_version":"1.0","source":{"id":"1509.03072","kind":"arxiv","version":6}},"canonical_sha256":"6c4fc9623e498cfedfbeeeb2dc1fd8796cedafde10c8c8f5cb7ad588cd0432fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c4fc9623e498cfedfbeeeb2dc1fd8796cedafde10c8c8f5cb7ad588cd0432fb","first_computed_at":"2026-05-18T01:09:12.660775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:12.660775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9b51kMt1u8EyH+/Q2OwgI1Cpgs7VSpWDVALV/GECs7diSPLXfg2BQPhUa1jKD963THEQcLbOa8RtzYlY6KCoCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:12.661518Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.03072","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20128233dea37decfd8c22be0a2aac0988742cb3b9406af26137211de4b12cde","sha256:2034816c48f4852b44a2e2f3eb402863376238b26fe0bf27cb7290e4e63f0825"],"state_sha256":"e0239e36f77c2ba7cfce58a7f7d1e8300240af1715eade283e8e5c82330ebd77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lq7+Ah+Gs4UKRDumJEtASJRXp7QvAz1DZgUoREfF3MW645fpioncWdckebVBL72znADFBkuTdT9vtTkriTHaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:00:20.341126Z","bundle_sha256":"4ec71d29c529cabdfe34aaa2e6a4973fb1bc04724182e8601e428e5efc313541"}}