{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:X47KBZCDSAID5D5T77HMF6XVGW","short_pith_number":"pith:X47KBZCD","schema_version":"1.0","canonical_sha256":"bf3ea0e44390103e8fb3ffcec2faf53594d91dc35b55ab42fa1a1be7cea9602e","source":{"kind":"arxiv","id":"1502.00413","version":2},"attestation_state":"computed","paper":{"title":"Constructing Near Spanning Trees with Few Local Inspections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Dana Ron, Guy Moshkovitz, Reut Levi, Ronitt Rubinfeld","submitted_at":"2015-02-02T09:20:39Z","abstract_excerpt":"Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. Motivated by several recent studies of local graph algorithms, we consider the following variant of this problem. Let G be a connected bounded-degree graph. Given an edge $e$ in $G$ we would like to decide whether $e$ belongs to a connected subgraph $G'$ consisting of $(1+\\epsilon)n$ edges (for a prespecified constant $\\epsilon >0$), where the decision for different edges should be consistent with the same subgraph $G'$. Can this task be performed by inspecting only a {\\em constant} number of edges in $G$? "},"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":"1502.00413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-02T09:20:39Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ed938fabc74e67ae55db02459f4fef81676d3414de1b5619dc2d364ae6531fbd","abstract_canon_sha256":"ee898200759447074b4da363f6e3b76b24585393bc9729c1bd1b868b04dea3a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:04.708695Z","signature_b64":"V7d5qJ5HGHGJCgMEjyqMprh0CX73TOnxK2MoCQL5ARw6Eo//2SgdJ1/9mrOXvTb4vTIUwwOAZwXLrPj1hD01Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf3ea0e44390103e8fb3ffcec2faf53594d91dc35b55ab42fa1a1be7cea9602e","last_reissued_at":"2026-05-18T02:28:04.708280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:04.708280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing Near Spanning Trees with Few Local Inspections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Dana Ron, Guy Moshkovitz, Reut Levi, Ronitt Rubinfeld","submitted_at":"2015-02-02T09:20:39Z","abstract_excerpt":"Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. Motivated by several recent studies of local graph algorithms, we consider the following variant of this problem. Let G be a connected bounded-degree graph. Given an edge $e$ in $G$ we would like to decide whether $e$ belongs to a connected subgraph $G'$ consisting of $(1+\\epsilon)n$ edges (for a prespecified constant $\\epsilon >0$), where the decision for different edges should be consistent with the same subgraph $G'$. Can this task be performed by inspecting only a {\\em constant} number of edges in $G$? "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00413","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1502.00413","created_at":"2026-05-18T02:28:04.708346+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00413v2","created_at":"2026-05-18T02:28:04.708346+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00413","created_at":"2026-05-18T02:28:04.708346+00:00"},{"alias_kind":"pith_short_12","alias_value":"X47KBZCDSAID","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"X47KBZCDSAID5D5T","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"X47KBZCD","created_at":"2026-05-18T12:29:47.479230+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/X47KBZCDSAID5D5T77HMF6XVGW","json":"https://pith.science/pith/X47KBZCDSAID5D5T77HMF6XVGW.json","graph_json":"https://pith.science/api/pith-number/X47KBZCDSAID5D5T77HMF6XVGW/graph.json","events_json":"https://pith.science/api/pith-number/X47KBZCDSAID5D5T77HMF6XVGW/events.json","paper":"https://pith.science/paper/X47KBZCD"},"agent_actions":{"view_html":"https://pith.science/pith/X47KBZCDSAID5D5T77HMF6XVGW","download_json":"https://pith.science/pith/X47KBZCDSAID5D5T77HMF6XVGW.json","view_paper":"https://pith.science/paper/X47KBZCD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00413&json=true","fetch_graph":"https://pith.science/api/pith-number/X47KBZCDSAID5D5T77HMF6XVGW/graph.json","fetch_events":"https://pith.science/api/pith-number/X47KBZCDSAID5D5T77HMF6XVGW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X47KBZCDSAID5D5T77HMF6XVGW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X47KBZCDSAID5D5T77HMF6XVGW/action/storage_attestation","attest_author":"https://pith.science/pith/X47KBZCDSAID5D5T77HMF6XVGW/action/author_attestation","sign_citation":"https://pith.science/pith/X47KBZCDSAID5D5T77HMF6XVGW/action/citation_signature","submit_replication":"https://pith.science/pith/X47KBZCDSAID5D5T77HMF6XVGW/action/replication_record"}},"created_at":"2026-05-18T02:28:04.708346+00:00","updated_at":"2026-05-18T02:28:04.708346+00:00"}