{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OUJSGUMTUMQKFR7XBKBVKMSO3N","short_pith_number":"pith:OUJSGUMT","canonical_record":{"source":{"id":"1512.08961","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2015-12-30T15:01:18Z","cross_cats_sorted":[],"title_canon_sha256":"ea78635e455485f3408ac855f29487155ffdd046aa00f9220e259bbb23ce3720","abstract_canon_sha256":"5b9f76aa8a97d3b00dcb1bc355e8dfe22d8c28656c09c435fe23e594e54093e5"},"schema_version":"1.0"},"canonical_sha256":"7513235193a320a2c7f70a8355324edb45ec85f1d5ea9ecee4b62c2ca36c49f9","source":{"kind":"arxiv","id":"1512.08961","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08961","created_at":"2026-05-18T01:23:34Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08961v1","created_at":"2026-05-18T01:23:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08961","created_at":"2026-05-18T01:23:34Z"},{"alias_kind":"pith_short_12","alias_value":"OUJSGUMTUMQK","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OUJSGUMTUMQKFR7X","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OUJSGUMT","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OUJSGUMTUMQKFR7XBKBVKMSO3N","target":"record","payload":{"canonical_record":{"source":{"id":"1512.08961","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2015-12-30T15:01:18Z","cross_cats_sorted":[],"title_canon_sha256":"ea78635e455485f3408ac855f29487155ffdd046aa00f9220e259bbb23ce3720","abstract_canon_sha256":"5b9f76aa8a97d3b00dcb1bc355e8dfe22d8c28656c09c435fe23e594e54093e5"},"schema_version":"1.0"},"canonical_sha256":"7513235193a320a2c7f70a8355324edb45ec85f1d5ea9ecee4b62c2ca36c49f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:34.365868Z","signature_b64":"S9rA3fsz1/GpU/Bb8AWRvzdTAFdKejKeTPBUt9S6MEZpjZGmga7fhvsrmG7IamkxXJrjXjf+C+9RraeN3a7FCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7513235193a320a2c7f70a8355324edb45ec85f1d5ea9ecee4b62c2ca36c49f9","last_reissued_at":"2026-05-18T01:23:34.365093Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:34.365093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.08961","source_version":1,"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:23:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KN6qqYJasXTYkoyaLWhi+oyTwUvE16lkQL4DLryE+9A/AWge/CGElTEg7e3s9tSte2KirlzNLxVEM3UHm7H0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T05:40:51.641635Z"},"content_sha256":"12aa5a6ef0454eadcce0a2ce79da1151bfa41caf80aa20cbdefc9a8df6acfda8","schema_version":"1.0","event_id":"sha256:12aa5a6ef0454eadcce0a2ce79da1151bfa41caf80aa20cbdefc9a8df6acfda8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OUJSGUMTUMQKFR7XBKBVKMSO3N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Generalization of Brown's Construction for the Degree/Diameter Problem","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yawara Ishida","submitted_at":"2015-12-30T15:01:18Z","abstract_excerpt":"The degree/diameter problem is the problem of finding the largest possible number of vertices $n_{\\Delta,D}$ in a graph of given degree $\\Delta$ and diameter $D$. We consider the problem for the case of diameter $D=2$. William G Brown gave a lower bound of the order of $(\\Delta,2)$-graph. In this paper, we give a generalization of his construction and improve the lower bounds for the case of $\\Delta=306$ and $\\Delta=307$. One is $(306,2)$-graph with $88723$ vertices, the other is $(307,2)$-graph with $88724$ vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08961","kind":"arxiv","version":1},"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:23:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ei1um7whFRMzdrGTMOpcWED3zZRDKAOwuADm8+lMpg5nM/IKXU0ewB/6op5DMtVr44N42DlUJUWOjMUk+ckVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T05:40:51.641973Z"},"content_sha256":"fda5903335fb46ecd7689060f7b79e82fae0bc644c40f57976b0d6248f60faf5","schema_version":"1.0","event_id":"sha256:fda5903335fb46ecd7689060f7b79e82fae0bc644c40f57976b0d6248f60faf5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OUJSGUMTUMQKFR7XBKBVKMSO3N/bundle.json","state_url":"https://pith.science/pith/OUJSGUMTUMQKFR7XBKBVKMSO3N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OUJSGUMTUMQKFR7XBKBVKMSO3N/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-07-05T05:40:51Z","links":{"resolver":"https://pith.science/pith/OUJSGUMTUMQKFR7XBKBVKMSO3N","bundle":"https://pith.science/pith/OUJSGUMTUMQKFR7XBKBVKMSO3N/bundle.json","state":"https://pith.science/pith/OUJSGUMTUMQKFR7XBKBVKMSO3N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OUJSGUMTUMQKFR7XBKBVKMSO3N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OUJSGUMTUMQKFR7XBKBVKMSO3N","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":"5b9f76aa8a97d3b00dcb1bc355e8dfe22d8c28656c09c435fe23e594e54093e5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2015-12-30T15:01:18Z","title_canon_sha256":"ea78635e455485f3408ac855f29487155ffdd046aa00f9220e259bbb23ce3720"},"schema_version":"1.0","source":{"id":"1512.08961","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08961","created_at":"2026-05-18T01:23:34Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08961v1","created_at":"2026-05-18T01:23:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08961","created_at":"2026-05-18T01:23:34Z"},{"alias_kind":"pith_short_12","alias_value":"OUJSGUMTUMQK","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OUJSGUMTUMQKFR7X","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OUJSGUMT","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:fda5903335fb46ecd7689060f7b79e82fae0bc644c40f57976b0d6248f60faf5","target":"graph","created_at":"2026-05-18T01:23:34Z","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 is the problem of finding the largest possible number of vertices $n_{\\Delta,D}$ in a graph of given degree $\\Delta$ and diameter $D$. We consider the problem for the case of diameter $D=2$. William G Brown gave a lower bound of the order of $(\\Delta,2)$-graph. In this paper, we give a generalization of his construction and improve the lower bounds for the case of $\\Delta=306$ and $\\Delta=307$. One is $(306,2)$-graph with $88723$ vertices, the other is $(307,2)$-graph with $88724$ vertices.","authors_text":"Yawara Ishida","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2015-12-30T15:01:18Z","title":"A Generalization of Brown's Construction for the Degree/Diameter Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08961","kind":"arxiv","version":1},"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:12aa5a6ef0454eadcce0a2ce79da1151bfa41caf80aa20cbdefc9a8df6acfda8","target":"record","created_at":"2026-05-18T01:23:34Z","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":"5b9f76aa8a97d3b00dcb1bc355e8dfe22d8c28656c09c435fe23e594e54093e5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2015-12-30T15:01:18Z","title_canon_sha256":"ea78635e455485f3408ac855f29487155ffdd046aa00f9220e259bbb23ce3720"},"schema_version":"1.0","source":{"id":"1512.08961","kind":"arxiv","version":1}},"canonical_sha256":"7513235193a320a2c7f70a8355324edb45ec85f1d5ea9ecee4b62c2ca36c49f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7513235193a320a2c7f70a8355324edb45ec85f1d5ea9ecee4b62c2ca36c49f9","first_computed_at":"2026-05-18T01:23:34.365093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:34.365093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S9rA3fsz1/GpU/Bb8AWRvzdTAFdKejKeTPBUt9S6MEZpjZGmga7fhvsrmG7IamkxXJrjXjf+C+9RraeN3a7FCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:34.365868Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.08961","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12aa5a6ef0454eadcce0a2ce79da1151bfa41caf80aa20cbdefc9a8df6acfda8","sha256:fda5903335fb46ecd7689060f7b79e82fae0bc644c40f57976b0d6248f60faf5"],"state_sha256":"5f8a2e708267821ff437d629fd8c807a84d771a70dcd2331189c6ab9c02a3048"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygGtmQnPmv4oQY+DHrZ2xSRMl2tQ5fEKPduZeZW7XIh8QkG4JzI3WMAZ7fwb/MdahzydIgOuXgm0DfcPqSUeAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T05:40:51.643809Z","bundle_sha256":"c2f3186d0d846b82b312025c6eda4fa9e25442e8426c7a904c6f90fb51121884"}}