{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:K7DTEJI4VAZ3AHV64XASHC7THW","short_pith_number":"pith:K7DTEJI4","canonical_record":{"source":{"id":"1307.4456","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-17T00:14:26Z","cross_cats_sorted":[],"title_canon_sha256":"578184486b0b538d5f1670d388a82c28ae58947843bb6d8b6030216b0df40cfc","abstract_canon_sha256":"83fc0e03ba6d4a55a9214206c4311f39fa9139c535340c33c402d579c3de2834"},"schema_version":"1.0"},"canonical_sha256":"57c732251ca833b01ebee5c1238bf33da20fe9e8df83107005ff95d4ec997037","source":{"kind":"arxiv","id":"1307.4456","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4456","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4456v3","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4456","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"pith_short_12","alias_value":"K7DTEJI4VAZ3","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K7DTEJI4VAZ3AHV6","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K7DTEJI4","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:K7DTEJI4VAZ3AHV64XASHC7THW","target":"record","payload":{"canonical_record":{"source":{"id":"1307.4456","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-17T00:14:26Z","cross_cats_sorted":[],"title_canon_sha256":"578184486b0b538d5f1670d388a82c28ae58947843bb6d8b6030216b0df40cfc","abstract_canon_sha256":"83fc0e03ba6d4a55a9214206c4311f39fa9139c535340c33c402d579c3de2834"},"schema_version":"1.0"},"canonical_sha256":"57c732251ca833b01ebee5c1238bf33da20fe9e8df83107005ff95d4ec997037","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:21.413541Z","signature_b64":"Vhp03w6crmEkcXmHVyakdRq/4/6l9rdcOEAB55T8ZlcRGIlqT7i51wX602ZHkRlW3JUg1+2L92B9KC1ydW9aAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57c732251ca833b01ebee5c1238bf33da20fe9e8df83107005ff95d4ec997037","last_reissued_at":"2026-05-18T00:46:21.413049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:21.413049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.4456","source_version":3,"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-18T00:46:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KNjz9XUtGRObyGjy8oMmcD5LqOD9MspHvj+WBC6P2YDCFYPLHInlkkDmwCRcOYe78YLwgmCmip673I2x1tYbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:58:59.884903Z"},"content_sha256":"3931ab66429e73c7701c42af85c8cd5364b1197d4a8aa27aadce7eedf0001584","schema_version":"1.0","event_id":"sha256:3931ab66429e73c7701c42af85c8cd5364b1197d4a8aa27aadce7eedf0001584"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:K7DTEJI4VAZ3AHV64XASHC7THW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The degree-diameter problem for sparse graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood, Guillermo Pineda-Villavicencio","submitted_at":"2013-07-17T00:14:26Z","abstract_excerpt":"The degree-diameter problem asks for the maximum number of vertices in a graph with maximum degree $\\Delta$ and diameter $k$. For fixed $k$, the answer is $\\Theta(\\Delta^k)$. We consider the degree-diameter problem for particular classes of sparse graphs, and establish the following results. For graphs of bounded average degree the answer is $\\Theta(\\Delta^{k-1})$, and for graphs of bounded arboricity the answer is $\\Theta(\\Delta^{\\floor{k/2}})$, in both cases for fixed $k$. For graphs of given treewidth, we determine the the maximum number of vertices up to a constant factor. More precise bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4456","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"},"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-18T00:46:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yViFiHdHfWRG60w/0CBb8ypkncdv2Zvb2Z7r69P8DHzVHEMvYAgjiDnwDqJnQbLDnlpoVufmO0IQoergRtKSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:58:59.885240Z"},"content_sha256":"95ec7a29841bd6c082fea4487dd685fdba0283327a5bb14195a4e7a9a9177157","schema_version":"1.0","event_id":"sha256:95ec7a29841bd6c082fea4487dd685fdba0283327a5bb14195a4e7a9a9177157"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K7DTEJI4VAZ3AHV64XASHC7THW/bundle.json","state_url":"https://pith.science/pith/K7DTEJI4VAZ3AHV64XASHC7THW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K7DTEJI4VAZ3AHV64XASHC7THW/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-06-22T04:58:59Z","links":{"resolver":"https://pith.science/pith/K7DTEJI4VAZ3AHV64XASHC7THW","bundle":"https://pith.science/pith/K7DTEJI4VAZ3AHV64XASHC7THW/bundle.json","state":"https://pith.science/pith/K7DTEJI4VAZ3AHV64XASHC7THW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K7DTEJI4VAZ3AHV64XASHC7THW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:K7DTEJI4VAZ3AHV64XASHC7THW","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":"83fc0e03ba6d4a55a9214206c4311f39fa9139c535340c33c402d579c3de2834","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-17T00:14:26Z","title_canon_sha256":"578184486b0b538d5f1670d388a82c28ae58947843bb6d8b6030216b0df40cfc"},"schema_version":"1.0","source":{"id":"1307.4456","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4456","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4456v3","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4456","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"pith_short_12","alias_value":"K7DTEJI4VAZ3","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K7DTEJI4VAZ3AHV6","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K7DTEJI4","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:95ec7a29841bd6c082fea4487dd685fdba0283327a5bb14195a4e7a9a9177157","target":"graph","created_at":"2026-05-18T00:46:21Z","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":"The degree-diameter problem asks for the maximum number of vertices in a graph with maximum degree $\\Delta$ and diameter $k$. For fixed $k$, the answer is $\\Theta(\\Delta^k)$. We consider the degree-diameter problem for particular classes of sparse graphs, and establish the following results. For graphs of bounded average degree the answer is $\\Theta(\\Delta^{k-1})$, and for graphs of bounded arboricity the answer is $\\Theta(\\Delta^{\\floor{k/2}})$, in both cases for fixed $k$. For graphs of given treewidth, we determine the the maximum number of vertices up to a constant factor. More precise bou","authors_text":"David R. Wood, Guillermo Pineda-Villavicencio","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-17T00:14:26Z","title":"The degree-diameter problem for sparse graph classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4456","kind":"arxiv","version":3},"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:3931ab66429e73c7701c42af85c8cd5364b1197d4a8aa27aadce7eedf0001584","target":"record","created_at":"2026-05-18T00:46:21Z","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":"83fc0e03ba6d4a55a9214206c4311f39fa9139c535340c33c402d579c3de2834","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-17T00:14:26Z","title_canon_sha256":"578184486b0b538d5f1670d388a82c28ae58947843bb6d8b6030216b0df40cfc"},"schema_version":"1.0","source":{"id":"1307.4456","kind":"arxiv","version":3}},"canonical_sha256":"57c732251ca833b01ebee5c1238bf33da20fe9e8df83107005ff95d4ec997037","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57c732251ca833b01ebee5c1238bf33da20fe9e8df83107005ff95d4ec997037","first_computed_at":"2026-05-18T00:46:21.413049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:21.413049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vhp03w6crmEkcXmHVyakdRq/4/6l9rdcOEAB55T8ZlcRGIlqT7i51wX602ZHkRlW3JUg1+2L92B9KC1ydW9aAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:21.413541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4456","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3931ab66429e73c7701c42af85c8cd5364b1197d4a8aa27aadce7eedf0001584","sha256:95ec7a29841bd6c082fea4487dd685fdba0283327a5bb14195a4e7a9a9177157"],"state_sha256":"0ee0522cb736537207ec54e6b8835683633a085236e14bd553c7849832ce0f5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ySjwxXhu60r4iXjcj4jXx0mtkx4LDIXjkQG6Rw6dRZyOho9xOcVUWwAp1eujA/RHkA/5pfBF28Fl03AjFrn1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T04:58:59.887577Z","bundle_sha256":"73e467d72a722813b92c1cef07b29ff612b0e47e74220f0a8155db7077675296"}}