{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:M4X4UYZFC3HQK3ESRCBFCR6E5S","short_pith_number":"pith:M4X4UYZF","schema_version":"1.0","canonical_sha256":"672fca632516cf056c9288825147c4ec8750f84bf8c08de2a387dd370d396157","source":{"kind":"arxiv","id":"1512.05411","version":1},"attestation_state":"computed","paper":{"title":"Non-Local Probes Do Not Help with Graph Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Juho Hirvonen, Jukka Suomela, Mika G\\\"o\\\"os, Moti Medina, Reut Levi","submitted_at":"2015-12-16T23:31:25Z","abstract_excerpt":"This work bridges the gap between distributed and centralised models of computing in the context of sublinear-time graph algorithms. A priori, typical centralised models of computing (e.g., parallel decision trees or centralised local algorithms) seem to be much more powerful than distributed message-passing algorithms: centralised algorithms can directly probe any part of the input, while in distributed algorithms nodes can only communicate with their immediate neighbours. We show that for a large class of graph problems, this extra freedom does not help centralised algorithms at all: for exa"},"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":"1512.05411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-16T23:31:25Z","cross_cats_sorted":[],"title_canon_sha256":"59e8d084d3201e0aa2e0ab021b3acc4f775f921a1ee50901b7c83a415797ea4b","abstract_canon_sha256":"840cc34bdd70471333fc780277f993ca3e985b06781e9ce7605cc4c9c63068fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:10.127025Z","signature_b64":"NCVq7LZp184jHZMqEWePbYf2xl3zmECE2rmASsqWNb80VtokT18VKRZLRkF/Q2hYm0vfvHOhfpJuXSXgg9GOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"672fca632516cf056c9288825147c4ec8750f84bf8c08de2a387dd370d396157","last_reissued_at":"2026-05-18T01:24:10.126419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:10.126419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Local Probes Do Not Help with Graph Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Juho Hirvonen, Jukka Suomela, Mika G\\\"o\\\"os, Moti Medina, Reut Levi","submitted_at":"2015-12-16T23:31:25Z","abstract_excerpt":"This work bridges the gap between distributed and centralised models of computing in the context of sublinear-time graph algorithms. A priori, typical centralised models of computing (e.g., parallel decision trees or centralised local algorithms) seem to be much more powerful than distributed message-passing algorithms: centralised algorithms can directly probe any part of the input, while in distributed algorithms nodes can only communicate with their immediate neighbours. We show that for a large class of graph problems, this extra freedom does not help centralised algorithms at all: for exa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05411","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":"1512.05411","created_at":"2026-05-18T01:24:10.126511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.05411v1","created_at":"2026-05-18T01:24:10.126511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05411","created_at":"2026-05-18T01:24:10.126511+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4X4UYZFC3HQ","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4X4UYZFC3HQK3ES","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4X4UYZF","created_at":"2026-05-18T12:29:32.376354+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/M4X4UYZFC3HQK3ESRCBFCR6E5S","json":"https://pith.science/pith/M4X4UYZFC3HQK3ESRCBFCR6E5S.json","graph_json":"https://pith.science/api/pith-number/M4X4UYZFC3HQK3ESRCBFCR6E5S/graph.json","events_json":"https://pith.science/api/pith-number/M4X4UYZFC3HQK3ESRCBFCR6E5S/events.json","paper":"https://pith.science/paper/M4X4UYZF"},"agent_actions":{"view_html":"https://pith.science/pith/M4X4UYZFC3HQK3ESRCBFCR6E5S","download_json":"https://pith.science/pith/M4X4UYZFC3HQK3ESRCBFCR6E5S.json","view_paper":"https://pith.science/paper/M4X4UYZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.05411&json=true","fetch_graph":"https://pith.science/api/pith-number/M4X4UYZFC3HQK3ESRCBFCR6E5S/graph.json","fetch_events":"https://pith.science/api/pith-number/M4X4UYZFC3HQK3ESRCBFCR6E5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4X4UYZFC3HQK3ESRCBFCR6E5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4X4UYZFC3HQK3ESRCBFCR6E5S/action/storage_attestation","attest_author":"https://pith.science/pith/M4X4UYZFC3HQK3ESRCBFCR6E5S/action/author_attestation","sign_citation":"https://pith.science/pith/M4X4UYZFC3HQK3ESRCBFCR6E5S/action/citation_signature","submit_replication":"https://pith.science/pith/M4X4UYZFC3HQK3ESRCBFCR6E5S/action/replication_record"}},"created_at":"2026-05-18T01:24:10.126511+00:00","updated_at":"2026-05-18T01:24:10.126511+00:00"}