{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3JWCCFR6ZDPUFDLHN7M6MK4M32","short_pith_number":"pith:3JWCCFR6","canonical_record":{"source":{"id":"1405.5015","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2014-05-20T09:54:59Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e46252cf5357a91ba00ceb9dff1dc32c3f47f14b71f6a161c092741b4759a4a2","abstract_canon_sha256":"818cb19a7f8991b33d78222ccf849b2edc53b618da62dd81d4bd6d2e592e3e99"},"schema_version":"1.0"},"canonical_sha256":"da6c21163ec8df428d676fd9e62b8cde88f23189cddd8edab1d82d84a56f3bf3","source":{"kind":"arxiv","id":"1405.5015","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5015","created_at":"2026-05-18T02:51:32Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5015v1","created_at":"2026-05-18T02:51:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5015","created_at":"2026-05-18T02:51:32Z"},{"alias_kind":"pith_short_12","alias_value":"3JWCCFR6ZDPU","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3JWCCFR6ZDPUFDLH","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3JWCCFR6","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3JWCCFR6ZDPUFDLHN7M6MK4M32","target":"record","payload":{"canonical_record":{"source":{"id":"1405.5015","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2014-05-20T09:54:59Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e46252cf5357a91ba00ceb9dff1dc32c3f47f14b71f6a161c092741b4759a4a2","abstract_canon_sha256":"818cb19a7f8991b33d78222ccf849b2edc53b618da62dd81d4bd6d2e592e3e99"},"schema_version":"1.0"},"canonical_sha256":"da6c21163ec8df428d676fd9e62b8cde88f23189cddd8edab1d82d84a56f3bf3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:32.352811Z","signature_b64":"O/Sss2BtLVuVQA0M8TORQd2C7rhio8Edq+Ymvg/U6LGySlQ/2/xQ482CT9kivRQ9hURppwrXgiFdiK4rM7imDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da6c21163ec8df428d676fd9e62b8cde88f23189cddd8edab1d82d84a56f3bf3","last_reissued_at":"2026-05-18T02:51:32.352277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:32.352277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.5015","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-18T02:51:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BMG3t45aepRr/RETYPUPQLgj9WVedaTHm/YR0FuptGzmPL9LLqNxjTFWvtz+dmhqGfrWLkXGME+PFyUloKkWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:05:20.636916Z"},"content_sha256":"b143dacd50f7f7dc824ec58617be26ddfddf2cfe261c0cc7e9d8f61c44e568e5","schema_version":"1.0","event_id":"sha256:b143dacd50f7f7dc824ec58617be26ddfddf2cfe261c0cc7e9d8f61c44e568e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3JWCCFR6ZDPUFDLHN7M6MK4M32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphs of order $n$ and diameter $2(n-1)/3$ minimizing the spectral radius","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.SP","authors_text":"Jingfen Lan, Lingsheng Shi","submitted_at":"2014-05-20T09:54:59Z","abstract_excerpt":"The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. A minimizer graph is such that minimizes the spectral radius among all connected graphs on $n$ vertices with diameter $d$. The minimizer graphs are known for $d\\in\\{1,2\\}\\cup [n/2,2n/3-1]\\cup\\{n-k\\mid k=1,2,...,8\\}$. In this paper, we determine all minimizer graphs for $d=2(n-1)/3$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5015","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-18T02:51:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fwq5GHUytYvvQ7KaUGNrpDFFOqW/ptDlJ+u8lR4t0EILTz8L5C4zLfkS/UJYKsOAzyvbPWY26dljqCH1MEVgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:05:20.637263Z"},"content_sha256":"e1e72b83425acb4e553dd14386317f5108f1750a864e62f1efea7580143fe6a6","schema_version":"1.0","event_id":"sha256:e1e72b83425acb4e553dd14386317f5108f1750a864e62f1efea7580143fe6a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JWCCFR6ZDPUFDLHN7M6MK4M32/bundle.json","state_url":"https://pith.science/pith/3JWCCFR6ZDPUFDLHN7M6MK4M32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JWCCFR6ZDPUFDLHN7M6MK4M32/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-04T22:05:20Z","links":{"resolver":"https://pith.science/pith/3JWCCFR6ZDPUFDLHN7M6MK4M32","bundle":"https://pith.science/pith/3JWCCFR6ZDPUFDLHN7M6MK4M32/bundle.json","state":"https://pith.science/pith/3JWCCFR6ZDPUFDLHN7M6MK4M32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JWCCFR6ZDPUFDLHN7M6MK4M32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3JWCCFR6ZDPUFDLHN7M6MK4M32","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":"818cb19a7f8991b33d78222ccf849b2edc53b618da62dd81d4bd6d2e592e3e99","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2014-05-20T09:54:59Z","title_canon_sha256":"e46252cf5357a91ba00ceb9dff1dc32c3f47f14b71f6a161c092741b4759a4a2"},"schema_version":"1.0","source":{"id":"1405.5015","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5015","created_at":"2026-05-18T02:51:32Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5015v1","created_at":"2026-05-18T02:51:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5015","created_at":"2026-05-18T02:51:32Z"},{"alias_kind":"pith_short_12","alias_value":"3JWCCFR6ZDPU","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3JWCCFR6ZDPUFDLH","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3JWCCFR6","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:e1e72b83425acb4e553dd14386317f5108f1750a864e62f1efea7580143fe6a6","target":"graph","created_at":"2026-05-18T02:51:32Z","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 spectral radius of a graph is the largest eigenvalue of its adjacency matrix. A minimizer graph is such that minimizes the spectral radius among all connected graphs on $n$ vertices with diameter $d$. The minimizer graphs are known for $d\\in\\{1,2\\}\\cup [n/2,2n/3-1]\\cup\\{n-k\\mid k=1,2,...,8\\}$. In this paper, we determine all minimizer graphs for $d=2(n-1)/3$.","authors_text":"Jingfen Lan, Lingsheng Shi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2014-05-20T09:54:59Z","title":"Graphs of order $n$ and diameter $2(n-1)/3$ minimizing the spectral radius"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5015","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:b143dacd50f7f7dc824ec58617be26ddfddf2cfe261c0cc7e9d8f61c44e568e5","target":"record","created_at":"2026-05-18T02:51:32Z","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":"818cb19a7f8991b33d78222ccf849b2edc53b618da62dd81d4bd6d2e592e3e99","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2014-05-20T09:54:59Z","title_canon_sha256":"e46252cf5357a91ba00ceb9dff1dc32c3f47f14b71f6a161c092741b4759a4a2"},"schema_version":"1.0","source":{"id":"1405.5015","kind":"arxiv","version":1}},"canonical_sha256":"da6c21163ec8df428d676fd9e62b8cde88f23189cddd8edab1d82d84a56f3bf3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da6c21163ec8df428d676fd9e62b8cde88f23189cddd8edab1d82d84a56f3bf3","first_computed_at":"2026-05-18T02:51:32.352277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:32.352277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O/Sss2BtLVuVQA0M8TORQd2C7rhio8Edq+Ymvg/U6LGySlQ/2/xQ482CT9kivRQ9hURppwrXgiFdiK4rM7imDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:32.352811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.5015","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b143dacd50f7f7dc824ec58617be26ddfddf2cfe261c0cc7e9d8f61c44e568e5","sha256:e1e72b83425acb4e553dd14386317f5108f1750a864e62f1efea7580143fe6a6"],"state_sha256":"fad1497aeeb35992bf8512e2e3b72c9ca13214815bc3bd3ba7c1de4e5b55e734"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TsVVnZmKWEM9nOW3DVLhznQKp4jSB5kr+DR+/Xq6Ohd7ISALFxqkWiganlX4svdLD+E10C23EUQMuD4i5yjCDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:05:20.639233Z","bundle_sha256":"b59a3028bfe647f3746b3d2bc7cbfd4fe5b3ebba5e9fddbb74fab8dc7d56ccf7"}}