{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3JWCCFR6ZDPUFDLHN7M6MK4M32","short_pith_number":"pith:3JWCCFR6","schema_version":"1.0","canonical_sha256":"da6c21163ec8df428d676fd9e62b8cde88f23189cddd8edab1d82d84a56f3bf3","source":{"kind":"arxiv","id":"1405.5015","version":1},"attestation_state":"computed","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$."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.5015","created_at":"2026-05-18T02:51:32.352364+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5015v1","created_at":"2026-05-18T02:51:32.352364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5015","created_at":"2026-05-18T02:51:32.352364+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JWCCFR6ZDPU","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JWCCFR6ZDPUFDLH","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JWCCFR6","created_at":"2026-05-18T12:28:11.866339+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/3JWCCFR6ZDPUFDLHN7M6MK4M32","json":"https://pith.science/pith/3JWCCFR6ZDPUFDLHN7M6MK4M32.json","graph_json":"https://pith.science/api/pith-number/3JWCCFR6ZDPUFDLHN7M6MK4M32/graph.json","events_json":"https://pith.science/api/pith-number/3JWCCFR6ZDPUFDLHN7M6MK4M32/events.json","paper":"https://pith.science/paper/3JWCCFR6"},"agent_actions":{"view_html":"https://pith.science/pith/3JWCCFR6ZDPUFDLHN7M6MK4M32","download_json":"https://pith.science/pith/3JWCCFR6ZDPUFDLHN7M6MK4M32.json","view_paper":"https://pith.science/paper/3JWCCFR6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5015&json=true","fetch_graph":"https://pith.science/api/pith-number/3JWCCFR6ZDPUFDLHN7M6MK4M32/graph.json","fetch_events":"https://pith.science/api/pith-number/3JWCCFR6ZDPUFDLHN7M6MK4M32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JWCCFR6ZDPUFDLHN7M6MK4M32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JWCCFR6ZDPUFDLHN7M6MK4M32/action/storage_attestation","attest_author":"https://pith.science/pith/3JWCCFR6ZDPUFDLHN7M6MK4M32/action/author_attestation","sign_citation":"https://pith.science/pith/3JWCCFR6ZDPUFDLHN7M6MK4M32/action/citation_signature","submit_replication":"https://pith.science/pith/3JWCCFR6ZDPUFDLHN7M6MK4M32/action/replication_record"}},"created_at":"2026-05-18T02:51:32.352364+00:00","updated_at":"2026-05-18T02:51:32.352364+00:00"}