{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CN3LYNEDTJMP6HQSHVDV7ZRC7S","short_pith_number":"pith:CN3LYNED","canonical_record":{"source":{"id":"2608.07360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-07T16:02:23Z","cross_cats_sorted":["cs.LO","math.SP"],"title_canon_sha256":"e79265e9a313546ec8997cc7d97d6552ff2c6dcf3571303ae0639dbe1af22e8b","abstract_canon_sha256":"7e8dda503d509f73e787353f66cb0491ab8d4070d193d509ce04cbae36782619"},"schema_version":"1.0"},"canonical_sha256":"1376bc34839a58ff1e123d475fe622fca3b9a907908a5431f88ac520ea112380","source":{"kind":"arxiv","id":"2608.07360","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.07360","created_at":"2026-08-10T01:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"2608.07360v1","created_at":"2026-08-10T01:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07360","created_at":"2026-08-10T01:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"CN3LYNEDTJMP","created_at":"2026-08-10T01:15:08Z"},{"alias_kind":"pith_short_16","alias_value":"CN3LYNEDTJMP6HQS","created_at":"2026-08-10T01:15:08Z"},{"alias_kind":"pith_short_8","alias_value":"CN3LYNED","created_at":"2026-08-10T01:15:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CN3LYNEDTJMP6HQSHVDV7ZRC7S","target":"record","payload":{"canonical_record":{"source":{"id":"2608.07360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-07T16:02:23Z","cross_cats_sorted":["cs.LO","math.SP"],"title_canon_sha256":"e79265e9a313546ec8997cc7d97d6552ff2c6dcf3571303ae0639dbe1af22e8b","abstract_canon_sha256":"7e8dda503d509f73e787353f66cb0491ab8d4070d193d509ce04cbae36782619"},"schema_version":"1.0"},"canonical_sha256":"1376bc34839a58ff1e123d475fe622fca3b9a907908a5431f88ac520ea112380","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-10T01:15:08.701587Z","signature_b64":"McNlNzG8EYy7P30BXlOuudltA3K+2/MLfOFLrq0VebNOExjqt3UW41tze9M2tH0Fb6qnAQQOdZywzIIgQ4JpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1376bc34839a58ff1e123d475fe622fca3b9a907908a5431f88ac520ea112380","last_reissued_at":"2026-08-10T01:15:08.698558Z","signature_status":"signed_v1","first_computed_at":"2026-08-10T01:15:08.698558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.07360","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-08-10T01:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBvJjvVtpHgqnB2NpYCjaFjMw71Dq0K+Spn8edaAimfg/oNj+k9Jx0vjnsnHUH0z5rJUuDIAGLfhbMQ050oSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T03:36:07.706463Z"},"content_sha256":"3b964270dd8cf6d741f7b2d4b590c689efb080c7a3093d9d389162dc18896d0c","schema_version":"1.0","event_id":"sha256:3b964270dd8cf6d741f7b2d4b590c689efb080c7a3093d9d389162dc18896d0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CN3LYNEDTJMP6HQSHVDV7ZRC7S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.SP"],"primary_cat":"math.CO","authors_text":"Ji Liu, Jinzheng Li, Yuanjie Ren, Zeru Zhu","submitted_at":"2026-08-07T16:02:23Z","abstract_excerpt":"Kolokolnikov conjectured that, among finite simple graphs on $n$ vertices with exactly $2(n-2)$ edges, the complete bipartite graph $K_{2,n-2}$ maximizes algebraic connectivity. We prove the conjectured statement for every $n\\ge123$: every such graph has algebraic connectivity at most $2$, while $K_{2,n-2}$ attains $2$. The proof begins with explicit Rayleigh-quotient certificates that exclude several local configurations from a hypothetical counterexample. A global degree count then controls the number and total excess of vertices of degree at least $5$ and bounds the edge excess of the subgr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07360","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.07360/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-08-10T01:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VrFi6pYAiZF/FCy3DqF3y/P6j8Jz06rasPlnrlPWMwIUeloBVfI+SOWVUEZFd0yrNtxzZgBo3dWLRe44FQuTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T03:36:07.706951Z"},"content_sha256":"dce7fdcc15b1a49ea0292e147a79f7a562f74afdea3cdffbf4cd48650d9ce892","schema_version":"1.0","event_id":"sha256:dce7fdcc15b1a49ea0292e147a79f7a562f74afdea3cdffbf4cd48650d9ce892"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CN3LYNEDTJMP6HQSHVDV7ZRC7S/bundle.json","state_url":"https://pith.science/pith/CN3LYNEDTJMP6HQSHVDV7ZRC7S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CN3LYNEDTJMP6HQSHVDV7ZRC7S/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-08-11T03:36:07Z","links":{"resolver":"https://pith.science/pith/CN3LYNEDTJMP6HQSHVDV7ZRC7S","bundle":"https://pith.science/pith/CN3LYNEDTJMP6HQSHVDV7ZRC7S/bundle.json","state":"https://pith.science/pith/CN3LYNEDTJMP6HQSHVDV7ZRC7S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CN3LYNEDTJMP6HQSHVDV7ZRC7S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CN3LYNEDTJMP6HQSHVDV7ZRC7S","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":"7e8dda503d509f73e787353f66cb0491ab8d4070d193d509ce04cbae36782619","cross_cats_sorted":["cs.LO","math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-07T16:02:23Z","title_canon_sha256":"e79265e9a313546ec8997cc7d97d6552ff2c6dcf3571303ae0639dbe1af22e8b"},"schema_version":"1.0","source":{"id":"2608.07360","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.07360","created_at":"2026-08-10T01:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"2608.07360v1","created_at":"2026-08-10T01:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07360","created_at":"2026-08-10T01:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"CN3LYNEDTJMP","created_at":"2026-08-10T01:15:08Z"},{"alias_kind":"pith_short_16","alias_value":"CN3LYNEDTJMP6HQS","created_at":"2026-08-10T01:15:08Z"},{"alias_kind":"pith_short_8","alias_value":"CN3LYNED","created_at":"2026-08-10T01:15:08Z"}],"graph_snapshots":[{"event_id":"sha256:dce7fdcc15b1a49ea0292e147a79f7a562f74afdea3cdffbf4cd48650d9ce892","target":"graph","created_at":"2026-08-10T01:15:08Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.07360/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Kolokolnikov conjectured that, among finite simple graphs on $n$ vertices with exactly $2(n-2)$ edges, the complete bipartite graph $K_{2,n-2}$ maximizes algebraic connectivity. We prove the conjectured statement for every $n\\ge123$: every such graph has algebraic connectivity at most $2$, while $K_{2,n-2}$ attains $2$. The proof begins with explicit Rayleigh-quotient certificates that exclude several local configurations from a hypothetical counterexample. A global degree count then controls the number and total excess of vertices of degree at least $5$ and bounds the edge excess of the subgr","authors_text":"Ji Liu, Jinzheng Li, Yuanjie Ren, Zeru Zhu","cross_cats":["cs.LO","math.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-07T16:02:23Z","title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07360","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:3b964270dd8cf6d741f7b2d4b590c689efb080c7a3093d9d389162dc18896d0c","target":"record","created_at":"2026-08-10T01:15:08Z","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":"7e8dda503d509f73e787353f66cb0491ab8d4070d193d509ce04cbae36782619","cross_cats_sorted":["cs.LO","math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-07T16:02:23Z","title_canon_sha256":"e79265e9a313546ec8997cc7d97d6552ff2c6dcf3571303ae0639dbe1af22e8b"},"schema_version":"1.0","source":{"id":"2608.07360","kind":"arxiv","version":1}},"canonical_sha256":"1376bc34839a58ff1e123d475fe622fca3b9a907908a5431f88ac520ea112380","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1376bc34839a58ff1e123d475fe622fca3b9a907908a5431f88ac520ea112380","first_computed_at":"2026-08-10T01:15:08.698558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-10T01:15:08.698558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"McNlNzG8EYy7P30BXlOuudltA3K+2/MLfOFLrq0VebNOExjqt3UW41tze9M2tH0Fb6qnAQQOdZywzIIgQ4JpBw==","signature_status":"signed_v1","signed_at":"2026-08-10T01:15:08.701587Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.07360","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b964270dd8cf6d741f7b2d4b590c689efb080c7a3093d9d389162dc18896d0c","sha256:dce7fdcc15b1a49ea0292e147a79f7a562f74afdea3cdffbf4cd48650d9ce892"],"state_sha256":"579173c826bcc3f7df4b9e3c4dc490c2700bd0d64b2c58907a10188bd6c02f09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AqgypfmFg9bC1UPYXxZRXfAHx7iuqfj8w9CBf9E73n+DWPK9PVBWYUiPwFdjz0lp9ZES48tsA8QDiRJVutfMAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T03:36:07.712217Z","bundle_sha256":"19033f6a6c2604bb537a31032ab98e48c69a766399b0543b4b8d99f666bfe666"}}