{"as_of":"2026-08-15T06:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:05d981e090ae327c9fac848fc967ead8880f761916315581b4adfb2766279bf0","coverage":[{"denominator":79,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":79,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T05:51:16.849455Z","state":"measured"},{"denominator":79,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":79,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2509.05129/citation-record","integrity":"/paper/2509.05129/integrity","json":"/paper/2509.05129/citation-record.json","paper":"/paper/2509.05129"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.904636Z","title":"CAMVIT: Choice routing","venue":null,"work_id":"d1929033-1978-4ff6-bd6e-bee64b97bd65","year":2009},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.553604Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:4491b9fc3d12b760f1d079f70371ea2212ae4f2522dc2ed6e0664b2ecb31e9c7","observation_id":"23673180-7373-4dfa-9010-bb5944134ff0","resolution":{"observed_at":"2026-08-05T05:51:17.908427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.892111Z","title":"Goldberg, and Renato Fonseca F","venue":null,"work_id":"699c6814-f334-4ff0-944a-f42de06fea9e","year":null},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.558149Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:72ef39451214e0c78c0c3d81b1a8134ea1f15922ac456224606573b57cdac82c","observation_id":"9187b004-144b-4ee5-acb4-c9c2179bd7d2","resolution":{"observed_at":"2026-08-05T05:51:17.895908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.865479Z","title":null,"venue":null,"work_id":"e63890a1-e1af-4a09-be12-f54462497451","year":2013},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.566233Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:f44c11049922ffcfc045247a4548cc2f962437994013ff655329dc5b961a5117","observation_id":"c1a8b99d-180c-4f7e-b1dd-98d0dec3af4a","resolution":{"observed_at":"2026-08-05T05:51:17.869581Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.853022Z","title":null,"venue":null,"work_id":"c69cd653-0128-4e08-87da-3a0d16dbf871","year":2018},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.570218Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:2aa4b18f7ad921ec2750fac90d8d54e7746b485a4d2b48680fe8a68c76cb36b1","observation_id":"5b3e9453-d39f-4e53-ad3d-e9bc42c8c1a5","resolution":{"observed_at":"2026-08-05T05:51:17.856522Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.840062Z","title":null,"venue":null,"work_id":"3ef47614-2775-44f3-8db4-73fe1e1b2599","year":null},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.574104Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:e73f2647153c2fc0507d0cac8fd1be514c5ad240db036a7e269f6be816684830","observation_id":"2eac958b-aa6a-4c37-8698-78dc72ac0e15","resolution":{"observed_at":"2026-08-05T05:51:17.844039Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.812942Z","title":null,"venue":null,"work_id":"68f42497-e0f2-4bba-8a50-9edb458c66d5","year":2017},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.581943Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:c39dd2fc809ab261135b60e2fb7ebba41600688baba35e0b714c97873111624f","observation_id":"e794fcde-7837-4583-ab17-317b11adf931","resolution":{"observed_at":"2026-08-05T05:51:17.816840Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.799256Z","title":null,"venue":null,"work_id":"d30d7dcf-aff7-4ba4-87b3-641426d3a5e3","year":2025},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.585767Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:18a205054e255ebb98451c847fdb9b4075da979ef2c3c788b41b1aa90e196a7f","observation_id":"05395642-5b7c-48b9-bf1c-cef5eabae4ab","resolution":{"observed_at":"2026-08-05T05:51:17.803142Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.786698Z","title":null,"venue":null,"work_id":"76e8f84b-de75-4307-b1df-3d86222073bf","year":2011},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.589507Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:045cef22b3661e2854050fb5b57344539a106e1a412b51a06aab53b2eccb68e2","observation_id":"25beb931-d5f4-4c0a-ab53-9b49bda7f0e9","resolution":{"observed_at":"2026-08-05T05:51:17.790432Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.773705Z","title":"Bodlaender","venue":null,"work_id":"f9dc5f81-6ae3-404b-8e3e-d37fba99d972","year":2006},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.593728Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:053ad7c92976e906dce35049556223562aa4a60e31bf11127017457c50edf576","observation_id":"439baf83-2c7c-494f-b454-22e1355883eb","resolution":{"observed_at":"2026-08-05T05:51:17.777799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.760844Z","title":"1998.Modern graph theory","venue":null,"work_id":"5538daac-c52a-4af0-ae15-ee08cf4613d6","year":1998},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.597608Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:1bffc0d1bcc65e746adb8a83152772606ec9c46e4760f77a81331d84a47aa866","observation_id":"a070534c-ccdf-4c9e-9517-d27f34121efb","resolution":{"observed_at":"2026-08-05T05:51:17.764663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.747400Z","title":"Boman, Kevin Deweese, and John R","venue":null,"work_id":"8bec48c1-4090-4b07-b40a-25497ded3584","year":2016},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.601500Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:3b469045bd35575f149fa4bddea7cd36cb635c3ccba0ed97da528b3e3708c8b8","observation_id":"c3861138-d58b-4b7e-85e5-7b2a3ce69ae6","resolution":{"observed_at":"2026-08-05T05:51:17.751894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.733890Z","title":null,"venue":null,"work_id":"dff367ef-4cac-427e-9a75-5e72cacb2ccf","year":2023},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.605415Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:ad034381b26f92181feb1c79a8d092995d9717666e9b199ad23a1597f9e4d930","observation_id":"282f4ec9-502e-45c0-819e-0586b03f7d76","resolution":{"observed_at":"2026-08-05T05:51:17.737902Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.720953Z","title":null,"venue":null,"work_id":"afabd6ff-c3a0-4fe4-90b2-82cb84806e18","year":2012},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.609179Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:328e3b50ff71e89f6a4735694af4a7e76b7bb5ee5679da9109efd10b4a9ddabd","observation_id":"feb8991e-ed36-4906-a57d-5f2cf26a49dc","resolution":{"observed_at":"2026-08-05T05:51:17.724875Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.708117Z","title":null,"venue":null,"work_id":"8722d675-d3c1-445a-bf75-e76f8e338fbf","year":2021},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.612977Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:427eacadcc8fffb11c20321f5543d60afec191232cc9a28751da88a5e4347ffd","observation_id":"2184fe09-861a-470a-8bed-35d8954bb529","resolution":{"observed_at":"2026-08-05T05:51:17.711973Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.694407Z","title":null,"venue":null,"work_id":"84afaeec-0bf0-4fbf-bd6a-e64b4cbaef32","year":null},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.616507Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:158d8c7f50404bc046cadf0fc93fa1d2a071751f303d9b7c0f1acded9aa9d7a8","observation_id":"e74921eb-f741-4ebb-8816-0edc677e870c","resolution":{"observed_at":"2026-08-05T05:51:17.698884Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.668369Z","title":null,"venue":null,"work_id":"800d232e-d812-4789-bd5e-44163c7c93d5","year":2002},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.624557Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:e354feee115ea2188147e956602b939d4370395c332204e2f748bb167eeda05f","observation_id":"99adde57-821b-4095-8a85-b4a59ebb445e","resolution":{"observed_at":"2026-08-05T05:51:17.672571Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.654320Z","title":"1997.Spectral graph theory","venue":null,"work_id":"bbb3d92c-3416-4ad2-ac63-c156aac60d91","year":1997},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.628509Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:9a13c77982f9b300c54b9bdae014a39295bdda0ad2edc2c5de6999acd41a19e8","observation_id":"b69c6889-03d1-4fd5-82dd-908780cd2f50","resolution":{"observed_at":"2026-08-05T05:51:17.658431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.641870Z","title":null,"venue":null,"work_id":"6a80583c-b399-4dd0-8db0-48fbd0ced75c","year":1994},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.632273Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:047b7b11dc55f92f4e199ce54c1662bbf51d63ea4662b1591a9907511d80e925","observation_id":"7ad4997c-b647-4fbb-a6cb-b94a86a9c0e3","resolution":{"observed_at":"2026-08-05T05:51:17.645673Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.628807Z","title":null,"venue":null,"work_id":"b32e474e-8067-4fb9-8f2d-f48dcbd88b9e","year":2002},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.635989Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:0e5d3c30be20b1bc0489b450d41f29d7c1bd27dd12f561a05a42fc275a8e04c3","observation_id":"a7a9c627-e909-4c79-9688-c5a308c94ed6","resolution":{"observed_at":"2026-08-05T05:51:17.632636Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.616023Z","title":"Cohen, Rasmus Kyng, Gary L","venue":null,"work_id":"d63186c5-d42e-436a-aa54-000b65335473","year":2014},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.639842Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:ba7038ae7693ffd8066b1e10c68af9ffc1084e65d11ff3e62bb8241175331c9b","observation_id":"06d04ba2-64df-4f90-b41e-00c3b0fbc05f","resolution":{"observed_at":"2026-08-05T05:51:17.619890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.603717Z","title":null,"venue":null,"work_id":"e9a2ef96-d8ae-4c93-82a1-6dcdd8118fe1","year":2017},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.643544Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:c74d3b97ffc5a0402c046bc7940ce5162ba85a3450b338ecae348bef75625aa9","observation_id":"0b1501d4-a013-4304-9b02-989f1979886d","resolution":{"observed_at":"2026-08-05T05:51:17.607313Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.591044Z","title":null,"venue":null,"work_id":"e05de47d-73a1-42ad-84be-7298df737bca","year":1977},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.647284Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:4e0ea3e1deeeba646b50341848da2b7d499c14d317f50224844af85b168ddacc","observation_id":"15a882fe-7e39-431b-a590-cff780cd66f9","resolution":{"observed_at":"2026-08-05T05:51:17.594920Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.578732Z","title":null,"venue":null,"work_id":"0b109495-e6df-4112-90db-2fcfb88c0d06","year":2009},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.650728Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:65297af8e03c6537a4fb82ea0a390d34f4aad6b3846b70c37b4aa9900e7ba506","observation_id":"9fd92b53-0966-4c8f-ad11-a70aa9807553","resolution":{"observed_at":"2026-08-05T05:51:17.582518Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.566150Z","title":null,"venue":null,"work_id":"ddd11fcd-8984-4c0d-96cf-e8236c75bc42","year":2022},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.654226Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:3c4f2524ce1fed43c046b67499f2ca51e35548f4edb70cfe4af2d0f9a01df565","observation_id":"edde1f0d-54e6-443c-a4f2-086391a1f484","resolution":{"observed_at":"2026-08-05T05:51:17.570092Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.553721Z","title":null,"venue":null,"work_id":"ae74ea7c-d436-4fd1-8e3b-f6a18cfec750","year":2024},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.658003Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:fc1388b85217e595e65a8e3ccab4e7531eaef0978a6493ad03e21a57d7a3cef0","observation_id":"fdafc128-3fc4-45ea-9f8f-1b845fec03fe","resolution":{"observed_at":"2026-08-05T05:51:17.557403Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.541585Z","title":null,"venue":null,"work_id":"7b88bf6a-3beb-46cc-83a2-de09ebc94e7f","year":2023},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.661638Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:1729dd2ce8469836a75f5bbae5d1fb9e9b573a75960a93b16998123d1c766562","observation_id":"c1d93177-69e6-4f47-bdf8-ffdf73f0c91e","resolution":{"observed_at":"2026-08-05T05:51:17.545187Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.528706Z","title":null,"venue":null,"work_id":"4442eee2-1ae6-4180-bcc7-86149ba2173e","year":2016},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.666393Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:f1c99055e30b79ede8fb0720f30be95f92971ac6e85d1bbcf9a68a66882cac51","observation_id":"4f93621a-c744-4231-a810-b907b7227110","resolution":{"observed_at":"2026-08-05T05:51:17.532445Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.515916Z","title":null,"venue":null,"work_id":"93984fe3-96ba-408b-b6a1-cbea86c432db","year":2023},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.670072Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:422973cd81c49bd692dcfe021e14dfe9e861dbe72c5abf9d4c2e3900374806ab","observation_id":"c79eda1e-cd6c-4c7b-8d76-4dfcc2acc6a0","resolution":{"observed_at":"2026-08-05T05:51:17.520099Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.502617Z","title":null,"venue":null,"work_id":"060ef7f7-59f4-4bf1-b5be-b9e2e9a4af95","year":2025},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.673545Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:9ea401eb02919beae588dce3792ceb5d1f218c426fbabbd679e272adef3c5df0","observation_id":"91a159a5-01de-46ec-bdd2-057f2fbf78a2","resolution":{"observed_at":"2026-08-05T05:51:17.506402Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.488254Z","title":null,"venue":null,"work_id":"8b95362e-e337-46be-b923-0d2308b41ece","year":2011},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.677315Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:cb05a660588135d1ed586ade6577f6938a2572d3cf24fad6c3d745c98782ea45","observation_id":"fcd5d449-d8dd-470a-a359-2ae9bc0cb300","resolution":{"observed_at":"2026-08-05T05:51:17.492183Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.474929Z","title":null,"venue":null,"work_id":"b291e3c8-dfc4-404c-84e8-27e7b2968f0e","year":null},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.680926Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:7257b40f1686373adad0615f4837e4331d50ad0fcaabc591e88f08fc523d9734","observation_id":"bc17f9b4-3878-45f6-a48f-2854aa2661b1","resolution":{"observed_at":"2026-08-05T05:51:17.478843Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.00709","last_updated":"2023-06-14T08:26:46Z","snapshot_observed_at":"2026-08-13T12:34:08.050361Z","submitted_at":"2023-03-01T18:07:51Z","title":"Robust and Practical Solution of Laplacian Equations by Approximate Elimination","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.00709","snapshot_observed_at":"2026-08-05T05:51:16.688683Z","title":"Spielman","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.688683Z"},"links":{"cited_paper":"/paper/2303.00709","citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:eef396055838ff285507ce0f59ef0d4742653b0e86cbae145b4f4add2f914f98","observation_id":"99cc54e4-eb8b-494e-a74d-24e1735f2a9a","resolution":{"observed_at":"2026-08-05T05:51:16.688683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.448833Z","title":null,"venue":null,"work_id":"98ec1764-7e98-436a-bff3-45678d1ff7a1","year":2001},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.692715Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:4298f808a3a8ccd1f1bd71437a1472aa3b9cbb97d736c85f494f540edfe89d62","observation_id":"73b949d7-f5f9-4c0a-9a5d-6422d97caf10","resolution":{"observed_at":"2026-08-05T05:51:17.452726Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.435519Z","title":"Goldberg and Chris Harrelson","venue":null,"work_id":"26f2b2a8-9da6-4b07-88b3-48483eda7baf","year":2005},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.696505Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:fdbcf9ec9bf573946408e150cb25bdea41ddda1e7cf7d051bb748925e1195140","observation_id":"bde42464-d8f4-4894-8267-01428865e02a","resolution":{"observed_at":"2026-08-05T05:51:17.439471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:16.700309Z","title":"2013.Matrix computations","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.700309Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:d2b57bc748a11e246d3ff18d96fbb964a6878a9961e3ce5b23b588c2a87a418c","observation_id":"7283e9d8-7ece-47e8-bdd7-7b0934dbad84","resolution":{"observed_at":"2026-08-05T05:51:16.700309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.413104Z","title":null,"venue":null,"work_id":"7808e97d-cb71-46e4-ae40-370fa2adc939","year":2019},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.704198Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:b10e168076f5d7fb4a7bf9975250399dfbed9d9a773826901d670d72707e2ea3","observation_id":"2143f133-5e9b-4c08-871d-3a565011363a","resolution":{"observed_at":"2026-08-05T05:51:17.416743Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.400825Z","title":null,"venue":null,"work_id":"aae2c4ae-2f38-4611-92e9-d241bcfcb81a","year":2016},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.708071Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:5804b72d52e9fdd632f4e22d8b18eb7ee5cfec52548ef856556a69fc88fa8fc1","observation_id":"627b4fe2-e386-48c5-a3d2-fa897de65045","resolution":{"observed_at":"2026-08-05T05:51:17.404537Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.387235Z","title":"Williamson","venue":null,"work_id":"39e9ce11-69c9-4d7e-adc1-d3417b21cb1c","year":2023},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.712001Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:5dd2c501690d7a64f0320eb255cf32685d32384e7f78d8922ad7abdeebe9ba72","observation_id":"fb044e84-d9b3-4ad5-ae9c-52c4c848c77a","resolution":{"observed_at":"2026-08-05T05:51:17.391798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.373593Z","title":null,"venue":null,"work_id":"67475dd3-82ec-434f-a876-7bb266c95c2d","year":2021},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.715759Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:b0dea408f5a2f59aebc05bf495bdf30514f79524c4d9cbb76bc58b38a45095cf","observation_id":"c35d2db3-b0ce-4279-9e73-c2ffa0fe6963","resolution":{"observed_at":"2026-08-05T05:51:17.377616Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.359152Z","title":null,"venue":null,"work_id":"736ab77a-2849-405c-b77f-7ecf82e4bf6c","year":null},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.719493Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:81ad74adbf1db1672b344dbf6c1a33edbd10295f34562c73217bfb5f4925b54e","observation_id":"eb6648c1-5384-424c-9e9b-1de80c4a1a08","resolution":{"observed_at":"2026-08-05T05:51:17.363353Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.332798Z","title":null,"venue":null,"work_id":"f317da26-b609-40ad-a83e-6618357544e2","year":2025},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.727085Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:f289932799158d183971986555d36b5ec45b3bf1661285258db26fc69ff8e7f1","observation_id":"dffe7d2e-8b39-45ed-8c6c-82ca2b041e16","resolution":{"observed_at":"2026-08-05T05:51:17.336730Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.318899Z","title":null,"venue":null,"work_id":"bbbabbcd-f69d-44b4-b72c-00f4298f1bb4","year":2017},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.731017Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:35f253d5a482432ec7f0faa7bb62c4bd925ec18e534ca2d486a2b68b2d73d41d","observation_id":"9ce6454e-b910-43c0-a2c1-012a2685e1c7","resolution":{"observed_at":"2026-08-05T05:51:17.322918Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.305872Z","title":null,"venue":null,"work_id":"285caa2a-755f-4073-a76f-4aef0ec370e0","year":2016},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.734681Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:416f009baecd7994ebccf5266126f64b42250a97b6bf4e586924dfba68c4ec53","observation_id":"9d2cbd7e-4383-4090-99c8-1d44f6fa2a28","resolution":{"observed_at":"2026-08-05T05:51:17.309799Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:16.738369Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.738369Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:4905127a21f62b359738664b6449aac215baaa01b9bdb80da31069c7fbad224e","observation_id":"fa0afd35-959e-4f7a-aa64-8cced68c8054","resolution":{"observed_at":"2026-08-05T05:51:16.738369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.283009Z","title":null,"venue":null,"work_id":"1128dba2-d2f3-4a00-ad51-6bb614c3f0f8","year":2023},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.742189Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:d11d1ba4a481b13b906643ab70ca407614feedae98922cae479c132bb737d28a","observation_id":"079e0998-2341-4167-8bc0-11f64507b5a7","resolution":{"observed_at":"2026-08-05T05:51:17.286987Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.269594Z","title":null,"venue":null,"work_id":"f7f2a966-fede-4931-9a41-f7efaa6781a3","year":2020},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.746070Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:d8d29a6a7ea5be7c3669f7defb1df89813cc6f8a5e9b2b783bc6d60458f89c48","observation_id":"94a97d01-19c3-4d02-bd87-300d5d7bf7d8","resolution":{"observed_at":"2026-08-05T05:51:17.273629Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.255246Z","title":null,"venue":null,"work_id":"d8883b31-9ce3-449b-abbb-600f731f4979","year":2025},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.749928Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:9c4755b616409133e63167c3d982cc874abf95ece906cb02c1c6d024c1dd6269","observation_id":"f7fbd28c-9b78-4b4c-a812-5709ddc7e384","resolution":{"observed_at":"2026-08-05T05:51:17.260167Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.241945Z","title":null,"venue":null,"work_id":"5c7066a7-a089-4c74-8a2e-001cfa2853f8","year":2023},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.753573Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:f4f8941f80ec9be4ba50aaf944028c599a1e1f1f45c235500f8f0799d3dab3ba","observation_id":"8b2c247e-858c-49c7-8d87-4dff7267d06c","resolution":{"observed_at":"2026-08-05T05:51:17.245807Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.227774Z","title":null,"venue":null,"work_id":"2c28dc6f-8549-4b30-9072-cbc4ca92346e","year":2024},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.757385Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:cdbee2896fb5ea94d02d2e946a84fb4b0f174ceea8c73f3ff02f90a118da3f28","observation_id":"79a45227-a4d2-4d88-ae06-18dcd50e874a","resolution":{"observed_at":"2026-08-05T05:51:17.231868Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.213142Z","title":null,"venue":null,"work_id":"a9d34ef0-4416-449d-8df3-6744d827962b","year":2023},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.761013Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:05dc10b7741d95f036f0ddccc1cacb81df9384ce6dfeb83fe2ca9d30d3c39301","observation_id":"0083a4d6-c143-441d-be7a-1776ff4864dd","resolution":{"observed_at":"2026-08-05T05:51:17.217599Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.200006Z","title":null,"venue":null,"work_id":"bf9f2002-21a0-4117-90ed-29b5c0cb9aa6","year":null},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.764624Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:ac1629475ae3b4d415b982e5789208339aa4aec837a6ca3b63340ec02d63eb8b","observation_id":"0c85c8a5-bbf9-46e3-8432-6512a7550bfa","resolution":{"observed_at":"2026-08-05T05:51:17.203881Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.173323Z","title":null,"venue":null,"work_id":"722b05cf-c05c-4ee5-8a6b-c8ebfc292aa0","year":2010},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.772061Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:17673846f2e94a16c0db6f3fb92d63b50d7754169d58dc71e5cd86ad225462fd","observation_id":"924bfad1-2b7b-4e63-8785-6ed9cdce1c41","resolution":{"observed_at":"2026-08-05T05:51:17.177305Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:16.775763Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.775763Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:d4b7d99d80f5e4d752ec04cd1b443fba077571f2d9651cdd3e69ba2cad2cc85e","observation_id":"8da9360e-9246-47ea-898c-1ad6d156cb01","resolution":{"observed_at":"2026-08-05T05:51:16.775763Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.150418Z","title":null,"venue":null,"work_id":"fa337dbe-5674-45a9-86f2-91bea7c9c742","year":2018},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.779436Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:aebf10fb4a3df8398db251ad3a1e49cf1f2f88f355d8015f4dc789b58c5c28f9","observation_id":"ebee86a7-2505-4bc0-8fda-f3190f518cde","resolution":{"observed_at":"2026-08-05T05:51:17.154443Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.137656Z","title":null,"venue":null,"work_id":"47ce81cc-0540-4de2-8cb9-ac77fa2b655a","year":null},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.783115Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:07ad740e2f4e45a4d4f27d7ad9fb1fc246c04770a2b31bfdd81d7da010c3d09a","observation_id":"ac9d1665-3207-4adc-af3b-77eb34a262d1","resolution":{"observed_at":"2026-08-05T05:51:17.141518Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.112142Z","title":null,"venue":null,"work_id":"49946a36-7990-4ebc-9042-3058b777954f","year":2018},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.790625Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:f72cdd7b091d8141e2561199a3ccad73dd3f735fc971e2930e8f4e8a8b14d154","observation_id":"79ec8ec8-c1bd-4207-b2cc-ec98996a2ea8","resolution":{"observed_at":"2026-08-05T05:51:17.116142Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.186778Z","title":"VLDB7, 12 (2014), 1023–1034","venue":null,"work_id":"1e1fcd82-34d5-4dbe-af90-a7b1f9f9f52a","year":2014},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.768386Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:c6bf2dff084ad923554d80262b7844fd7fc71040678d41daa14d0c8b50e5617f","observation_id":"4655e7ee-fcb1-4dfd-8e16-f2f0672c939a","resolution":{"observed_at":"2026-08-05T05:51:17.190711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.086249Z","title":null,"venue":null,"work_id":"3596240f-0e23-4499-8e29-551814ceffc4","year":2021},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.797686Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:e2857d0b6a741314dc475067d7a22aed26fe27bfc9925df97b189a781048b550","observation_id":"a64c5d3a-ff86-47b5-95c6-db6ca57cab74","resolution":{"observed_at":"2026-08-05T05:51:17.090037Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.073278Z","title":null,"venue":null,"work_id":"deaf0c94-c1de-4601-9ff8-1f8cf8b8fe21","year":1984},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.801222Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:6b24340e18905862b1852afda08b286ec9fd4d48afd47644d0fd89a8ca29bad5","observation_id":"d699961c-cda4-4c8f-8bcf-0176c8099e57","resolution":{"observed_at":"2026-08-05T05:51:17.077111Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.060236Z","title":null,"venue":null,"work_id":"82c068ab-b491-40d5-a67b-cdde81a63d28","year":2023},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.804949Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:2d5599a0830350aad25529db9059d05732d586c1fb2b03189e9a2e4c20fade7b","observation_id":"b125abfd-cea2-4d9e-b8d8-bd060d763b86","resolution":{"observed_at":"2026-08-05T05:51:17.064261Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.047320Z","title":null,"venue":null,"work_id":"b02827b4-4701-43be-a402-2157e6fc4d8c","year":2014},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.808896Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:bb7bde0b72e4c326b23fff8be812e17fa265ae8a8ab6519dca97c5ed10c32158","observation_id":"d8787806-fa69-466c-924e-7d160b2344a3","resolution":{"observed_at":"2026-08-05T05:51:17.051332Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.034319Z","title":null,"venue":null,"work_id":"04d8c2b3-5730-48e8-adc3-a43fe004db07","year":2021},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.812675Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:10903bb556da603dd921ffb7bc8ca1364297ee58dbbae7573b45f0deb085a715","observation_id":"a65e430a-c97e-45af-a1df-a8d55c9ef1f3","resolution":{"observed_at":"2026-08-05T05:51:17.038341Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.020889Z","title":"Spielman and Nikhil Srivastava","venue":null,"work_id":"1f8b112c-dc88-48a3-8659-528706a2c54d","year":2008},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.816278Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:a70020ccc717beba9a66dfe9ef36e7febc58b8cd87f03ecc51dbdc5e39a5520b","observation_id":"ee58adb0-1463-402a-a3c4-b1e38f89e09d","resolution":{"observed_at":"2026-08-05T05:51:17.024953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.099128Z","title":null,"venue":null,"work_id":"331c6fca-a628-421b-bc1e-6b14abeb01ad","year":2021},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.794077Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:a343cbffe484500316bf87ab6961539601ed39ae9c2f193e7bd44f9d81a1dd04","observation_id":"2772ea7d-1904-4c3e-adbe-a0fad5e1bc73","resolution":{"observed_at":"2026-08-05T05:51:17.103115Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:16.993618Z","title":"Bronstein","venue":null,"work_id":"1b562e36-755f-42c2-8698-55acbeb45c01","year":2022},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.823830Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:fa0ba8d156fd2683cbbd265e3b2959ade9afa6ef9c51e7069e285082142ab187","observation_id":"5ef56810-2dff-413a-91a2-9a5a62fcc03b","resolution":{"observed_at":"2026-08-05T05:51:16.998016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:16.979914Z","title":null,"venue":null,"work_id":"ed7ad83b-fdf1-4b28-8724-a5a764398cc2","year":2010},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.827533Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:db3ec64836513d7e907a34bee88e0b9c28b62b140175df8664a2494c915354a2","observation_id":"468d3489-cbf4-4437-8721-57b640790d2a","resolution":{"observed_at":"2026-08-05T05:51:16.984051Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:16.965944Z","title":null,"venue":null,"work_id":"a95efae1-7174-4c14-9a19-71df2161a746","year":2023},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.831080Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:5df0a3568aaaae93c5a42c12e77e0c33a49e278f71426ca13f7ba30edc97c6cd","observation_id":"5b79f6e1-a9e0-4e71-91c0-0d8bbaa9a24a","resolution":{"observed_at":"2026-08-05T05:51:16.969844Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:16.951337Z","title":null,"venue":null,"work_id":"3710261e-41b9-4eec-808b-b21908f5ac00","year":2012},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.834791Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:697c8c144099c4a04935158935d42a1a4c0bbe572f38e2eb81b60b98549fee78","observation_id":"2c7bd5ee-b2cb-4bd1-9484-583f033d7d7e","resolution":{"observed_at":"2026-08-05T05:51:16.955293Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:16.938255Z","title":null,"venue":null,"work_id":"4a37009e-b9bf-435f-8565-fd91f266beb1","year":null},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.838716Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:8fade0aef3d50741ec876ee6bd00d9b90b2c371f73e29ed64423529811f85cd1","observation_id":"947137b9-1861-4872-89f0-3ff52e2bbc64","resolution":{"observed_at":"2026-08-05T05:51:16.942335Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:16.911989Z","title":null,"venue":null,"work_id":"aaef02ca-21eb-4840-b345-b4a532b68620","year":2022},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.845917Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:30f46c48221e151d92dd5df304c5293c81296a7917eddcd114c4b2beb4a1f0e5","observation_id":"00d9dbb0-c5a3-4cc4-a32c-a674e8132b35","resolution":{"observed_at":"2026-08-05T05:51:16.915980Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.007052Z","title":null,"venue":null,"work_id":"39b4b6e4-dea9-482b-997c-b99757535ed5","year":1991},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.819948Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:c615125026290bbccccf318307367d74f737a94800fa97b3921ff48acf3e9e1b","observation_id":"ec9963db-cdfc-4b07-b049-e664ed8a1b37","resolution":{"observed_at":"2026-08-05T05:51:17.011065Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:16.925328Z","title":null,"venue":null,"work_id":"960ebdc5-1e46-4af8-869a-b28399ccf610","year":null},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.842400Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:c881074f2da60b4f0878f3f8d8e78ac391aa113044dabe397a30b3d296b1ba27","observation_id":"d32ea16e-1598-4631-8cb1-3b8a6b7d7e7b","resolution":{"observed_at":"2026-08-05T05:51:16.929295Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:16.896711Z","title":null,"venue":null,"work_id":"bbc91d49-73aa-4748-989f-5e6ba13b760c","year":2023},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.849455Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:1ff7c8b6ed6a44b145d9c3df7033742a311d6c524a3727522d42e91456940952","observation_id":"1256572b-4b15-41f9-b20e-84405e9d121e","resolution":{"observed_at":"2026-08-05T05:51:16.901720Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.878608Z","title":null,"venue":null,"work_id":"a82bb852-3899-44da-aab2-7b643352fbf4","year":null},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.561986Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:7f49f3bd30c22580e1db7a341af7972e2f441e870dfc94c1df2b938cbdbc464e","observation_id":"85c379c3-980c-4fbd-b350-aa6f3c11d9c5","resolution":{"observed_at":"2026-08-05T05:51:17.883092Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.461881Z","title":null,"venue":null,"work_id":"003849fe-1da8-4eda-8484-828974a5eda2","year":2013},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.684653Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:03a8ebd00f0c5c03c56575830c2b963cbad1e5f0b7d6ab35620ed897a4aa8081","observation_id":"f4d51cd7-2a75-495f-8e82-27fabf14bba9","resolution":{"observed_at":"2026-08-05T05:51:17.465893Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.345960Z","title":null,"venue":null,"work_id":"6d9ed271-76dc-4eb0-8297-f1e7a0806357","year":2014},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.723204Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:575cddbbc94069e310d60ebf6bfd940b2b6c05d8908a3e39875d03930194081a","observation_id":"97be54a1-8e6f-4c88-9d34-2c23ec58efae","resolution":{"observed_at":"2026-08-05T05:51:17.349948Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.826479Z","title":"InESA (LIPIcs, Vol","venue":null,"work_id":"ae8e298b-b893-40cb-8deb-12c3c37fe84d","year":null},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.577992Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:2d0065e7e1dcfc2de135d56709e9aa76eaeff03f912f1d1eb0d3a767f72b991c","observation_id":"68fbc25f-dd7c-4052-a8cf-6b3acf2473e5","resolution":{"observed_at":"2026-08-05T05:51:17.830889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.124892Z","title":"VLDB Endow.13, 5 (2020), 602–615","venue":null,"work_id":"33b3863d-cb40-44eb-a6d5-7ff12af17f76","year":2020},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.786869Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:f3c75597cb819535c7da5bf88d4a014d6f076ba85ff0f5fd6aaa06946b51582d","observation_id":"3501b555-5a17-41f2-9d1f-67f0e8d597d1","resolution":{"observed_at":"2026-08-05T05:51:17.128720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:51:17.681611Z","title":"InSIGMOD","venue":null,"work_id":"99fe798d-cb5d-491b-8828-0bdb4140bc04","year":null},"citing_paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-05T05:51:16.620269Z"},"links":{"citing_paper":"/paper/2509.05129"},"observation_digest":"sha256:ff5be816f719dcbcac5ed2e35d432339bbc7c1c2b89027f3b96bcf4dd380bfbd","observation_id":"b580c11c-cf4c-4647-9b11-f6ce4c963136","resolution":{"observed_at":"2026-08-05T05:51:17.685625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.05129","last_updated":"2025-09-05T14:14:36Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-13T02:43:57.909795Z","submitted_at":"2025-09-05T14:14:36Z","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach"},"reference_resolution":{"displayed":79,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":64,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":79},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 79 of 79 outbound references and 0 inbound Pith citation observations for arXiv:2509.05129."}