{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YG2NHKHL7XPQI7IJPPJAMXRHIG","short_pith_number":"pith:YG2NHKHL","schema_version":"1.0","canonical_sha256":"c1b4d3a8ebfddf047d097bd2065e274188d4883e8cb3e2b315705d75ff0fee14","source":{"kind":"arxiv","id":"2509.05129","version":1},"attestation_state":"computed","paper":{"title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","cs.LG"],"primary_cat":"cs.DB","authors_text":"Guoren Wang, Meihao Liao, Rong-Hua Li, Yueyang Pan","submitted_at":"2025-09-05T14:14:36Z","abstract_excerpt":"Resistance distance computation is a fundamental problem in graph analysis, yet existing random walk-based methods are limited to approximate solutions and suffer from poor efficiency on small-treewidth graphs (e.g., road networks). In contrast, shortest-path distance computation achieves remarkable efficiency on such graphs by leveraging cut properties and tree decompositions. Motivated by this disparity, we first analyze the cut property of resistance distance. While a direct generalization proves impractical due to costly matrix operations, we overcome this limitation by integrating tree de"},"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":"2509.05129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-09-05T14:14:36Z","cross_cats_sorted":["cs.DM","cs.DS","cs.LG"],"title_canon_sha256":"ce36b1ba7dd0d6386e71154b08c906a59e3c0d3f1b377852d82208a326ea4c3c","abstract_canon_sha256":"672abe8db7a7ea5abb2dad74eb3d1885fe0566f2d76251b6c99adb8695f233ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:05:36.541968Z","signature_b64":"TKaMkMf40csGxQsG0TQ6VMExuIiBB0hhWQDu3vhHdsomE0mKAg/Ego/Xr/DBNEfFOtkJU7lh+nwiwr+F44SaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1b4d3a8ebfddf047d097bd2065e274188d4883e8cb3e2b315705d75ff0fee14","last_reissued_at":"2026-07-05T12:05:36.541506Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:05:36.541506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","cs.LG"],"primary_cat":"cs.DB","authors_text":"Guoren Wang, Meihao Liao, Rong-Hua Li, Yueyang Pan","submitted_at":"2025-09-05T14:14:36Z","abstract_excerpt":"Resistance distance computation is a fundamental problem in graph analysis, yet existing random walk-based methods are limited to approximate solutions and suffer from poor efficiency on small-treewidth graphs (e.g., road networks). In contrast, shortest-path distance computation achieves remarkable efficiency on such graphs by leveraging cut properties and tree decompositions. Motivated by this disparity, we first analyze the cut property of resistance distance. While a direct generalization proves impractical due to costly matrix operations, we overcome this limitation by integrating tree de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.05129","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/2509.05129/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":"2509.05129","created_at":"2026-07-05T12:05:36.541558+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.05129v1","created_at":"2026-07-05T12:05:36.541558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.05129","created_at":"2026-07-05T12:05:36.541558+00:00"},{"alias_kind":"pith_short_12","alias_value":"YG2NHKHL7XPQ","created_at":"2026-07-05T12:05:36.541558+00:00"},{"alias_kind":"pith_short_16","alias_value":"YG2NHKHL7XPQI7IJ","created_at":"2026-07-05T12:05:36.541558+00:00"},{"alias_kind":"pith_short_8","alias_value":"YG2NHKHL","created_at":"2026-07-05T12:05:36.541558+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/YG2NHKHL7XPQI7IJPPJAMXRHIG","json":"https://pith.science/pith/YG2NHKHL7XPQI7IJPPJAMXRHIG.json","graph_json":"https://pith.science/api/pith-number/YG2NHKHL7XPQI7IJPPJAMXRHIG/graph.json","events_json":"https://pith.science/api/pith-number/YG2NHKHL7XPQI7IJPPJAMXRHIG/events.json","paper":"https://pith.science/paper/YG2NHKHL"},"agent_actions":{"view_html":"https://pith.science/pith/YG2NHKHL7XPQI7IJPPJAMXRHIG","download_json":"https://pith.science/pith/YG2NHKHL7XPQI7IJPPJAMXRHIG.json","view_paper":"https://pith.science/paper/YG2NHKHL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.05129&json=true","fetch_graph":"https://pith.science/api/pith-number/YG2NHKHL7XPQI7IJPPJAMXRHIG/graph.json","fetch_events":"https://pith.science/api/pith-number/YG2NHKHL7XPQI7IJPPJAMXRHIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YG2NHKHL7XPQI7IJPPJAMXRHIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YG2NHKHL7XPQI7IJPPJAMXRHIG/action/storage_attestation","attest_author":"https://pith.science/pith/YG2NHKHL7XPQI7IJPPJAMXRHIG/action/author_attestation","sign_citation":"https://pith.science/pith/YG2NHKHL7XPQI7IJPPJAMXRHIG/action/citation_signature","submit_replication":"https://pith.science/pith/YG2NHKHL7XPQI7IJPPJAMXRHIG/action/replication_record"}},"created_at":"2026-07-05T12:05:36.541558+00:00","updated_at":"2026-07-05T12:05:36.541558+00:00"}