{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:A7LCLVHOR3QLQDLBPPVXCA7BTK","short_pith_number":"pith:A7LCLVHO","schema_version":"1.0","canonical_sha256":"07d625d4ee8ee0b80d617beb7103e19a8b768292898f44e0c4c5a5495d9da081","source":{"kind":"arxiv","id":"1807.09302","version":1},"attestation_state":"computed","paper":{"title":"Metric Sublinear Algorithms via Linear Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hossein Esfandiari, Michael Mitzenmacher","submitted_at":"2018-07-24T18:41:00Z","abstract_excerpt":"In this work we provide a new technique to design fast approximation algorithms for graph problems where the points of the graph lie in a metric space. Specifically, we present a sampling approach for such metric graphs that, using a sublinear number of edge weight queries, provides a {\\em linear sampling}, where each edge is (roughly speaking) sampled proportionally to its weight.\n  For several natural problems, such as densest subgraph and max cut among others, we show that by sparsifying the graph using this sampling process, we can run a suitable approximation algorithm on the sparsified 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":"1807.09302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-24T18:41:00Z","cross_cats_sorted":[],"title_canon_sha256":"fdba4cca8360f8288ce9901b3e8e545b4fe72a3a9f17ac714ca272f7f5806844","abstract_canon_sha256":"8dd68fc43d83786518b7fdcb27e597a2c0374a388336a9a1d9a8ddc9c56ecde5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:51.717647Z","signature_b64":"TIg+ik9HDNJmODkNuG/Wy5IaOM9MvxFVaWpeL5sXTZtTpjLnBfHWCsBVX3gMKWyFLndugGWUn0kx8x7vuDzYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07d625d4ee8ee0b80d617beb7103e19a8b768292898f44e0c4c5a5495d9da081","last_reissued_at":"2026-05-18T00:09:51.717049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:51.717049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metric Sublinear Algorithms via Linear Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hossein Esfandiari, Michael Mitzenmacher","submitted_at":"2018-07-24T18:41:00Z","abstract_excerpt":"In this work we provide a new technique to design fast approximation algorithms for graph problems where the points of the graph lie in a metric space. Specifically, we present a sampling approach for such metric graphs that, using a sublinear number of edge weight queries, provides a {\\em linear sampling}, where each edge is (roughly speaking) sampled proportionally to its weight.\n  For several natural problems, such as densest subgraph and max cut among others, we show that by sparsifying the graph using this sampling process, we can run a suitable approximation algorithm on the sparsified g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09302","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":"1807.09302","created_at":"2026-05-18T00:09:51.717136+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.09302v1","created_at":"2026-05-18T00:09:51.717136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09302","created_at":"2026-05-18T00:09:51.717136+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7LCLVHOR3QL","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7LCLVHOR3QLQDLB","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7LCLVHO","created_at":"2026-05-18T12:32:13.499390+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/A7LCLVHOR3QLQDLBPPVXCA7BTK","json":"https://pith.science/pith/A7LCLVHOR3QLQDLBPPVXCA7BTK.json","graph_json":"https://pith.science/api/pith-number/A7LCLVHOR3QLQDLBPPVXCA7BTK/graph.json","events_json":"https://pith.science/api/pith-number/A7LCLVHOR3QLQDLBPPVXCA7BTK/events.json","paper":"https://pith.science/paper/A7LCLVHO"},"agent_actions":{"view_html":"https://pith.science/pith/A7LCLVHOR3QLQDLBPPVXCA7BTK","download_json":"https://pith.science/pith/A7LCLVHOR3QLQDLBPPVXCA7BTK.json","view_paper":"https://pith.science/paper/A7LCLVHO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.09302&json=true","fetch_graph":"https://pith.science/api/pith-number/A7LCLVHOR3QLQDLBPPVXCA7BTK/graph.json","fetch_events":"https://pith.science/api/pith-number/A7LCLVHOR3QLQDLBPPVXCA7BTK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7LCLVHOR3QLQDLBPPVXCA7BTK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7LCLVHOR3QLQDLBPPVXCA7BTK/action/storage_attestation","attest_author":"https://pith.science/pith/A7LCLVHOR3QLQDLBPPVXCA7BTK/action/author_attestation","sign_citation":"https://pith.science/pith/A7LCLVHOR3QLQDLBPPVXCA7BTK/action/citation_signature","submit_replication":"https://pith.science/pith/A7LCLVHOR3QLQDLBPPVXCA7BTK/action/replication_record"}},"created_at":"2026-05-18T00:09:51.717136+00:00","updated_at":"2026-05-18T00:09:51.717136+00:00"}