{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CC5R4SFQUGRO2C4PVIHFQOGTTW","short_pith_number":"pith:CC5R4SFQ","schema_version":"1.0","canonical_sha256":"10bb1e48b0a1a2ed0b8faa0e5838d39da37877d83090d1dd71cbc6514e2574aa","source":{"kind":"arxiv","id":"1502.04022","version":1},"attestation_state":"computed","paper":{"title":"Local Computation Algorithms for Graphs of Non-Constant Degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anak Yodpinyanee, Reut Levi, Ronitt Rubinfeld","submitted_at":"2015-02-13T15:15:20Z","abstract_excerpt":"In the model of \\emph{local computation algorithms} (LCAs), we aim to compute the queried part of the output by examining only a small (sublinear) portion of the input. Many recently developed LCAs on graph problems achieve time and space complexities with very low dependence on $n$, the number of vertices. Nonetheless, these complexities are generally at least exponential in $d$, the upper bound on the degree of the input graph. Instead, we consider the case where parameter $d$ can be moderately dependent on $n$, and aim for complexities with subexponential dependence on $d$, while maintainin"},"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.04022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T15:15:20Z","cross_cats_sorted":[],"title_canon_sha256":"e93a983b47e5090cfc25da73b91e3c1c9dfa771e29deb304ab50892a0cc51b93","abstract_canon_sha256":"27724ee610c5792f4548d547cbce187e50ce83c149f661161190549cedf21eee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:06.720950Z","signature_b64":"39ks2Q6lCHWT6dTda+0Q9g97mQUjQH7SjkyuAHPLV2m4M9pfZnxET8dX/uYC3cjLaqqapANmonO+Vepbe8ecBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10bb1e48b0a1a2ed0b8faa0e5838d39da37877d83090d1dd71cbc6514e2574aa","last_reissued_at":"2026-05-18T02:27:06.720068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:06.720068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Computation Algorithms for Graphs of Non-Constant Degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anak Yodpinyanee, Reut Levi, Ronitt Rubinfeld","submitted_at":"2015-02-13T15:15:20Z","abstract_excerpt":"In the model of \\emph{local computation algorithms} (LCAs), we aim to compute the queried part of the output by examining only a small (sublinear) portion of the input. Many recently developed LCAs on graph problems achieve time and space complexities with very low dependence on $n$, the number of vertices. Nonetheless, these complexities are generally at least exponential in $d$, the upper bound on the degree of the input graph. Instead, we consider the case where parameter $d$ can be moderately dependent on $n$, and aim for complexities with subexponential dependence on $d$, while maintainin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04022","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":""},"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.04022","created_at":"2026-05-18T02:27:06.720213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.04022v1","created_at":"2026-05-18T02:27:06.720213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04022","created_at":"2026-05-18T02:27:06.720213+00:00"},{"alias_kind":"pith_short_12","alias_value":"CC5R4SFQUGRO","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CC5R4SFQUGRO2C4P","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CC5R4SFQ","created_at":"2026-05-18T12:29:14.074870+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/CC5R4SFQUGRO2C4PVIHFQOGTTW","json":"https://pith.science/pith/CC5R4SFQUGRO2C4PVIHFQOGTTW.json","graph_json":"https://pith.science/api/pith-number/CC5R4SFQUGRO2C4PVIHFQOGTTW/graph.json","events_json":"https://pith.science/api/pith-number/CC5R4SFQUGRO2C4PVIHFQOGTTW/events.json","paper":"https://pith.science/paper/CC5R4SFQ"},"agent_actions":{"view_html":"https://pith.science/pith/CC5R4SFQUGRO2C4PVIHFQOGTTW","download_json":"https://pith.science/pith/CC5R4SFQUGRO2C4PVIHFQOGTTW.json","view_paper":"https://pith.science/paper/CC5R4SFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.04022&json=true","fetch_graph":"https://pith.science/api/pith-number/CC5R4SFQUGRO2C4PVIHFQOGTTW/graph.json","fetch_events":"https://pith.science/api/pith-number/CC5R4SFQUGRO2C4PVIHFQOGTTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CC5R4SFQUGRO2C4PVIHFQOGTTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CC5R4SFQUGRO2C4PVIHFQOGTTW/action/storage_attestation","attest_author":"https://pith.science/pith/CC5R4SFQUGRO2C4PVIHFQOGTTW/action/author_attestation","sign_citation":"https://pith.science/pith/CC5R4SFQUGRO2C4PVIHFQOGTTW/action/citation_signature","submit_replication":"https://pith.science/pith/CC5R4SFQUGRO2C4PVIHFQOGTTW/action/replication_record"}},"created_at":"2026-05-18T02:27:06.720213+00:00","updated_at":"2026-05-18T02:27:06.720213+00:00"}