{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RPX7AKGUI4C33Z7Y4N4SANNBLF","short_pith_number":"pith:RPX7AKGU","schema_version":"1.0","canonical_sha256":"8beff028d44705bde7f8e3792035a1594e380f1e05067bd2fdec0c8dca035bae","source":{"kind":"arxiv","id":"1306.3284","version":7},"attestation_state":"computed","paper":{"title":"All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Edith Cohen","submitted_at":"2013-06-14T03:33:05Z","abstract_excerpt":"Graph datasets with billions of edges, such as social and Web graphs, are prevalent, and scalable computation is critical. All-distances sketches (ADS) [Cohen 1997], are a powerful tool for scalable approximation of statistics.\n  The sketch is a small size sample of the distance relation of a node which emphasizes closer nodes. Sketches for all nodes are computed using a nearly linear computation and estimators are applied to sketches of nodes to estimate their properties.\n  We provide, for the first time, a unified exposition of ADS algorithms and applications. We present the Historic Inverse"},"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":"1306.3284","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-14T03:33:05Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"1bf9d014abbec1714254df3c12e89ac8d58e60068b7d239ff14dc0124a5947eb","abstract_canon_sha256":"afb93de28fd4a915510e281186cefeedd044cd9d13657d9f1b3f80e0bbe98a3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:15.972342Z","signature_b64":"FD8bh/rFUFhB+D8ylJLT3ljc9zAjKL6wEtsQui9/R6F+Wl8e8/MBqED7MpxiEyrC853DKx1HI/aYQQvcdZ2xCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8beff028d44705bde7f8e3792035a1594e380f1e05067bd2fdec0c8dca035bae","last_reissued_at":"2026-05-18T02:29:15.971875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:15.971875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Edith Cohen","submitted_at":"2013-06-14T03:33:05Z","abstract_excerpt":"Graph datasets with billions of edges, such as social and Web graphs, are prevalent, and scalable computation is critical. All-distances sketches (ADS) [Cohen 1997], are a powerful tool for scalable approximation of statistics.\n  The sketch is a small size sample of the distance relation of a node which emphasizes closer nodes. Sketches for all nodes are computed using a nearly linear computation and estimators are applied to sketches of nodes to estimate their properties.\n  We provide, for the first time, a unified exposition of ADS algorithms and applications. We present the Historic Inverse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3284","kind":"arxiv","version":7},"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":"1306.3284","created_at":"2026-05-18T02:29:15.971948+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.3284v7","created_at":"2026-05-18T02:29:15.971948+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3284","created_at":"2026-05-18T02:29:15.971948+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPX7AKGUI4C3","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPX7AKGUI4C33Z7Y","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPX7AKGU","created_at":"2026-05-18T12:27:59.945178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.05723","citing_title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RPX7AKGUI4C33Z7Y4N4SANNBLF","json":"https://pith.science/pith/RPX7AKGUI4C33Z7Y4N4SANNBLF.json","graph_json":"https://pith.science/api/pith-number/RPX7AKGUI4C33Z7Y4N4SANNBLF/graph.json","events_json":"https://pith.science/api/pith-number/RPX7AKGUI4C33Z7Y4N4SANNBLF/events.json","paper":"https://pith.science/paper/RPX7AKGU"},"agent_actions":{"view_html":"https://pith.science/pith/RPX7AKGUI4C33Z7Y4N4SANNBLF","download_json":"https://pith.science/pith/RPX7AKGUI4C33Z7Y4N4SANNBLF.json","view_paper":"https://pith.science/paper/RPX7AKGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.3284&json=true","fetch_graph":"https://pith.science/api/pith-number/RPX7AKGUI4C33Z7Y4N4SANNBLF/graph.json","fetch_events":"https://pith.science/api/pith-number/RPX7AKGUI4C33Z7Y4N4SANNBLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPX7AKGUI4C33Z7Y4N4SANNBLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPX7AKGUI4C33Z7Y4N4SANNBLF/action/storage_attestation","attest_author":"https://pith.science/pith/RPX7AKGUI4C33Z7Y4N4SANNBLF/action/author_attestation","sign_citation":"https://pith.science/pith/RPX7AKGUI4C33Z7Y4N4SANNBLF/action/citation_signature","submit_replication":"https://pith.science/pith/RPX7AKGUI4C33Z7Y4N4SANNBLF/action/replication_record"}},"created_at":"2026-05-18T02:29:15.971948+00:00","updated_at":"2026-05-18T02:29:15.971948+00:00"}