{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:YG2NHKHL7XPQI7IJPPJAMXRHIG","short_pith_number":"pith:YG2NHKHL","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"},"canonical_sha256":"c1b4d3a8ebfddf047d097bd2065e274188d4883e8cb3e2b315705d75ff0fee14","source":{"kind":"arxiv","id":"2509.05129","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.05129","created_at":"2026-07-05T12:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"2509.05129v1","created_at":"2026-07-05T12:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.05129","created_at":"2026-07-05T12:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"YG2NHKHL7XPQ","created_at":"2026-07-05T12:05:36Z"},{"alias_kind":"pith_short_16","alias_value":"YG2NHKHL7XPQI7IJ","created_at":"2026-07-05T12:05:36Z"},{"alias_kind":"pith_short_8","alias_value":"YG2NHKHL","created_at":"2026-07-05T12:05:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:YG2NHKHL7XPQI7IJPPJAMXRHIG","target":"record","payload":{"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"},"canonical_sha256":"c1b4d3a8ebfddf047d097bd2065e274188d4883e8cb3e2b315705d75ff0fee14","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"},"source_kind":"arxiv","source_id":"2509.05129","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-07-05T12:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EcpOEesNFYBk/vPJbfVJq8M59Gu/zR3H1MefKL6e/EXs/+qnt+J1p3pGmyscFP7e42aorWPpH5LepJjPH3B3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T05:48:22.275525Z"},"content_sha256":"a262110a11e92fbd43dce51f6c1fdb82c3299445aaf8b1716a67faac78fd7b67","schema_version":"1.0","event_id":"sha256:a262110a11e92fbd43dce51f6c1fdb82c3299445aaf8b1716a67faac78fd7b67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:YG2NHKHL7XPQI7IJPPJAMXRHIG","target":"graph","payload":{"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"},"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-07-05T12:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vZ95gUpUfs7tlSoQL4OWinfHGWFKlKOZHv00gnprL8ob46MakiTsE8TGr4XrjBkEqbslII7rr4cLDVRxITY4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T05:48:22.276079Z"},"content_sha256":"2a0e5427f130d42e490f784a796c2b1d313b4e8dec3f0f108d80bb77235ac32b","schema_version":"1.0","event_id":"sha256:2a0e5427f130d42e490f784a796c2b1d313b4e8dec3f0f108d80bb77235ac32b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YG2NHKHL7XPQI7IJPPJAMXRHIG/bundle.json","state_url":"https://pith.science/pith/YG2NHKHL7XPQI7IJPPJAMXRHIG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YG2NHKHL7XPQI7IJPPJAMXRHIG/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-15T05:48:22Z","links":{"resolver":"https://pith.science/pith/YG2NHKHL7XPQI7IJPPJAMXRHIG","bundle":"https://pith.science/pith/YG2NHKHL7XPQI7IJPPJAMXRHIG/bundle.json","state":"https://pith.science/pith/YG2NHKHL7XPQI7IJPPJAMXRHIG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YG2NHKHL7XPQI7IJPPJAMXRHIG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YG2NHKHL7XPQI7IJPPJAMXRHIG","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":"672abe8db7a7ea5abb2dad74eb3d1885fe0566f2d76251b6c99adb8695f233ff","cross_cats_sorted":["cs.DM","cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-09-05T14:14:36Z","title_canon_sha256":"ce36b1ba7dd0d6386e71154b08c906a59e3c0d3f1b377852d82208a326ea4c3c"},"schema_version":"1.0","source":{"id":"2509.05129","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.05129","created_at":"2026-07-05T12:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"2509.05129v1","created_at":"2026-07-05T12:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.05129","created_at":"2026-07-05T12:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"YG2NHKHL7XPQ","created_at":"2026-07-05T12:05:36Z"},{"alias_kind":"pith_short_16","alias_value":"YG2NHKHL7XPQI7IJ","created_at":"2026-07-05T12:05:36Z"},{"alias_kind":"pith_short_8","alias_value":"YG2NHKHL","created_at":"2026-07-05T12:05:36Z"}],"graph_snapshots":[{"event_id":"sha256:2a0e5427f130d42e490f784a796c2b1d313b4e8dec3f0f108d80bb77235ac32b","target":"graph","created_at":"2026-07-05T12:05:36Z","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/2509.05129/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Guoren Wang, Meihao Liao, Rong-Hua Li, Yueyang Pan","cross_cats":["cs.DM","cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.05129","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:a262110a11e92fbd43dce51f6c1fdb82c3299445aaf8b1716a67faac78fd7b67","target":"record","created_at":"2026-07-05T12:05:36Z","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":"672abe8db7a7ea5abb2dad74eb3d1885fe0566f2d76251b6c99adb8695f233ff","cross_cats_sorted":["cs.DM","cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-09-05T14:14:36Z","title_canon_sha256":"ce36b1ba7dd0d6386e71154b08c906a59e3c0d3f1b377852d82208a326ea4c3c"},"schema_version":"1.0","source":{"id":"2509.05129","kind":"arxiv","version":1}},"canonical_sha256":"c1b4d3a8ebfddf047d097bd2065e274188d4883e8cb3e2b315705d75ff0fee14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1b4d3a8ebfddf047d097bd2065e274188d4883e8cb3e2b315705d75ff0fee14","first_computed_at":"2026-07-05T12:05:36.541506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:05:36.541506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TKaMkMf40csGxQsG0TQ6VMExuIiBB0hhWQDu3vhHdsomE0mKAg/Ego/Xr/DBNEfFOtkJU7lh+nwiwr+F44SaDA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:05:36.541968Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.05129","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a262110a11e92fbd43dce51f6c1fdb82c3299445aaf8b1716a67faac78fd7b67","sha256:2a0e5427f130d42e490f784a796c2b1d313b4e8dec3f0f108d80bb77235ac32b"],"state_sha256":"fb3034388f74afa946fe801a11151e581fe341ac029e734bc2fc7b051854c0ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GTE6DTpCnmjBQ+0C/YiPHJdXdrXq30UbULgDhDKdtDtefp3TNa4werTgBicK+ZbGQjkZ+LNAZv/IvYsdtsazAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T05:48:22.291568Z","bundle_sha256":"7d498f426eb19d5fc73bd23c2120771be78b35d493ecda1ecfa3d8dc4534ced4"}}