{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:74IURC4SD4P4L7D63VDUXLC2LF","short_pith_number":"pith:74IURC4S","schema_version":"1.0","canonical_sha256":"ff11488b921f1fc5fc7edd474bac5a597f7a0d0d26fe5a0777d1ad11c2e54fa4","source":{"kind":"arxiv","id":"2307.01218","version":1},"attestation_state":"computed","paper":{"title":"Effective Resistances in Non-Expander Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dongrun Cai, Pan Peng, Xue Chen","submitted_at":"2023-07-01T17:04:33Z","abstract_excerpt":"Effective resistances are ubiquitous in graph algorithms and network analysis. In this work, we study sublinear time algorithms to approximate the effective resistance of an adjacent pair $s$ and $t$. We consider the classical adjacency list model for local algorithms. While recent works have provided sublinear time algorithms for expander graphs, we prove several lower bounds for general graphs of $n$ vertices and $m$ edges:\n  1.It needs $\\Omega(n)$ queries to obtain $1.01$-approximations of the effective resistance of an adjacent pair $s$ and $t$, even for graphs of degree at most 3 except $"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2307.01218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-01T17:04:33Z","cross_cats_sorted":[],"title_canon_sha256":"476318d0a51308a635016a7f622c611878a67c00e81bfb94eb31a8a8b09e3705","abstract_canon_sha256":"e29e4ba56713090d1d47089cf86ea989ffa9b01dcf25b9a903eea21d69c6b143"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:27:53.079247Z","signature_b64":"JwJmhsRxAHMVdathNsAEl8gtP2Jme4RFXtdRPKuC6yGYNLEP5WanaFj4hz4lS89OsvOQeD09u+wszk81d0mpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff11488b921f1fc5fc7edd474bac5a597f7a0d0d26fe5a0777d1ad11c2e54fa4","last_reissued_at":"2026-07-05T06:27:53.078767Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:27:53.078767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective Resistances in Non-Expander Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dongrun Cai, Pan Peng, Xue Chen","submitted_at":"2023-07-01T17:04:33Z","abstract_excerpt":"Effective resistances are ubiquitous in graph algorithms and network analysis. In this work, we study sublinear time algorithms to approximate the effective resistance of an adjacent pair $s$ and $t$. We consider the classical adjacency list model for local algorithms. While recent works have provided sublinear time algorithms for expander graphs, we prove several lower bounds for general graphs of $n$ vertices and $m$ edges:\n  1.It needs $\\Omega(n)$ queries to obtain $1.01$-approximations of the effective resistance of an adjacent pair $s$ and $t$, even for graphs of degree at most 3 except $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.01218","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.01218/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2307.01218","created_at":"2026-07-05T06:27:53.078832+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.01218v1","created_at":"2026-07-05T06:27:53.078832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.01218","created_at":"2026-07-05T06:27:53.078832+00:00"},{"alias_kind":"pith_short_12","alias_value":"74IURC4SD4P4","created_at":"2026-07-05T06:27:53.078832+00:00"},{"alias_kind":"pith_short_16","alias_value":"74IURC4SD4P4L7D6","created_at":"2026-07-05T06:27:53.078832+00:00"},{"alias_kind":"pith_short_8","alias_value":"74IURC4S","created_at":"2026-07-05T06:27:53.078832+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/74IURC4SD4P4L7D63VDUXLC2LF","json":"https://pith.science/pith/74IURC4SD4P4L7D63VDUXLC2LF.json","graph_json":"https://pith.science/api/pith-number/74IURC4SD4P4L7D63VDUXLC2LF/graph.json","events_json":"https://pith.science/api/pith-number/74IURC4SD4P4L7D63VDUXLC2LF/events.json","paper":"https://pith.science/paper/74IURC4S"},"agent_actions":{"view_html":"https://pith.science/pith/74IURC4SD4P4L7D63VDUXLC2LF","download_json":"https://pith.science/pith/74IURC4SD4P4L7D63VDUXLC2LF.json","view_paper":"https://pith.science/paper/74IURC4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.01218&json=true","fetch_graph":"https://pith.science/api/pith-number/74IURC4SD4P4L7D63VDUXLC2LF/graph.json","fetch_events":"https://pith.science/api/pith-number/74IURC4SD4P4L7D63VDUXLC2LF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74IURC4SD4P4L7D63VDUXLC2LF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74IURC4SD4P4L7D63VDUXLC2LF/action/storage_attestation","attest_author":"https://pith.science/pith/74IURC4SD4P4L7D63VDUXLC2LF/action/author_attestation","sign_citation":"https://pith.science/pith/74IURC4SD4P4L7D63VDUXLC2LF/action/citation_signature","submit_replication":"https://pith.science/pith/74IURC4SD4P4L7D63VDUXLC2LF/action/replication_record"}},"created_at":"2026-07-05T06:27:53.078832+00:00","updated_at":"2026-07-05T06:27:53.078832+00:00"}