{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BOF3S6BVBALTE6E5PUCET3W466","short_pith_number":"pith:BOF3S6BV","schema_version":"1.0","canonical_sha256":"0b8bb97835081732789d7d0449eedcf7877854f95d73934c0b5cb0cc71a83267","source":{"kind":"arxiv","id":"2306.04005","version":2},"attestation_state":"computed","paper":{"title":"Edge Addition and the Change in Kemeny's Constant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John McAlister, Stephen Kirkland, Xiaohong Zhang, Yuqiao Li","submitted_at":"2023-06-06T20:35:50Z","abstract_excerpt":"Given a connected graph $G$, Kemeny's constant $\\mathcal{K}({G})$ measures the average travel time for a random walk to reach a randomly selected vertex. It is known that when an edge is added to $G$, the value of Kemeny's constant may either decrease, increase, or stay the same. In this paper, we present a quantitative analysis of this behaviour when the initial graph is a tree with $n$ vertices. We prove that when an edge is added into a tree on $n$ vertices, the maximum possible increase in Kemeny's constant is roughly $\\frac{2}{3}n,$ while the maximum possible decrease is roughly $\\frac{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":"2306.04005","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-06T20:35:50Z","cross_cats_sorted":[],"title_canon_sha256":"99a08f495af7d294ccead2777f55c3b869a6e5b7be5c0a389502b33dc8f5448e","abstract_canon_sha256":"c90764dac95e2e35ad4a201654eb461dce0b7fe28a7d75a672d1ed22ef8bb6aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:00.500413Z","signature_b64":"FggFRKaGR+ZciJ7HWA8gY7dK7Kgp4HxrkvaBIo+X7K2bSeqv7vKDHn0sXHDrWtJGw6+SauNpCbQe3KauTf9KBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b8bb97835081732789d7d0449eedcf7877854f95d73934c0b5cb0cc71a83267","last_reissued_at":"2026-07-05T10:07:00.499994Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:00.499994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge Addition and the Change in Kemeny's Constant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John McAlister, Stephen Kirkland, Xiaohong Zhang, Yuqiao Li","submitted_at":"2023-06-06T20:35:50Z","abstract_excerpt":"Given a connected graph $G$, Kemeny's constant $\\mathcal{K}({G})$ measures the average travel time for a random walk to reach a randomly selected vertex. It is known that when an edge is added to $G$, the value of Kemeny's constant may either decrease, increase, or stay the same. In this paper, we present a quantitative analysis of this behaviour when the initial graph is a tree with $n$ vertices. We prove that when an edge is added into a tree on $n$ vertices, the maximum possible increase in Kemeny's constant is roughly $\\frac{2}{3}n,$ while the maximum possible decrease is roughly $\\frac{3}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.04005","kind":"arxiv","version":2},"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/2306.04005/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2306.04005","created_at":"2026-07-05T10:07:00.500049+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.04005v2","created_at":"2026-07-05T10:07:00.500049+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.04005","created_at":"2026-07-05T10:07:00.500049+00:00"},{"alias_kind":"pith_short_12","alias_value":"BOF3S6BVBALT","created_at":"2026-07-05T10:07:00.500049+00:00"},{"alias_kind":"pith_short_16","alias_value":"BOF3S6BVBALTE6E5","created_at":"2026-07-05T10:07:00.500049+00:00"},{"alias_kind":"pith_short_8","alias_value":"BOF3S6BV","created_at":"2026-07-05T10:07:00.500049+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.21506","citing_title":"The Derivative of Kemeny's Constant as a Centrality Measure in Undirected Graphs","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BOF3S6BVBALTE6E5PUCET3W466","json":"https://pith.science/pith/BOF3S6BVBALTE6E5PUCET3W466.json","graph_json":"https://pith.science/api/pith-number/BOF3S6BVBALTE6E5PUCET3W466/graph.json","events_json":"https://pith.science/api/pith-number/BOF3S6BVBALTE6E5PUCET3W466/events.json","paper":"https://pith.science/paper/BOF3S6BV"},"agent_actions":{"view_html":"https://pith.science/pith/BOF3S6BVBALTE6E5PUCET3W466","download_json":"https://pith.science/pith/BOF3S6BVBALTE6E5PUCET3W466.json","view_paper":"https://pith.science/paper/BOF3S6BV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.04005&json=true","fetch_graph":"https://pith.science/api/pith-number/BOF3S6BVBALTE6E5PUCET3W466/graph.json","fetch_events":"https://pith.science/api/pith-number/BOF3S6BVBALTE6E5PUCET3W466/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BOF3S6BVBALTE6E5PUCET3W466/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BOF3S6BVBALTE6E5PUCET3W466/action/storage_attestation","attest_author":"https://pith.science/pith/BOF3S6BVBALTE6E5PUCET3W466/action/author_attestation","sign_citation":"https://pith.science/pith/BOF3S6BVBALTE6E5PUCET3W466/action/citation_signature","submit_replication":"https://pith.science/pith/BOF3S6BVBALTE6E5PUCET3W466/action/replication_record"}},"created_at":"2026-07-05T10:07:00.500049+00:00","updated_at":"2026-07-05T10:07:00.500049+00:00"}