{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:A7LCLVHOR3QLQDLBPPVXCA7BTK","short_pith_number":"pith:A7LCLVHO","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"},"canonical_sha256":"07d625d4ee8ee0b80d617beb7103e19a8b768292898f44e0c4c5a5495d9da081","source":{"kind":"arxiv","id":"1807.09302","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09302","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09302v1","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09302","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"A7LCLVHOR3QL","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A7LCLVHOR3QLQDLB","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A7LCLVHO","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:A7LCLVHOR3QLQDLBPPVXCA7BTK","target":"record","payload":{"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"},"canonical_sha256":"07d625d4ee8ee0b80d617beb7103e19a8b768292898f44e0c4c5a5495d9da081","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"},"source_kind":"arxiv","source_id":"1807.09302","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3eNqHWDeVquyHraIr1REzgvKKPY0l+32LKSm+tHlHU8/JEYGQtulUq3TMA+2CocXAEvCD9snIqhgPPQwVhVRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:10:04.718881Z"},"content_sha256":"07b521455806bbc9ff536c52e5848502d075704201aa4a733e03535e88e400d6","schema_version":"1.0","event_id":"sha256:07b521455806bbc9ff536c52e5848502d075704201aa4a733e03535e88e400d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:A7LCLVHOR3QLQDLBPPVXCA7BTK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DKIX4Mc7w2xqu6jyosRI+RbYhnKXpi3N2hlhcLBcpqwCPRhNvqG781So+OJokN7Y6Li7IhWvlLwtsr2PW0+8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:10:04.719209Z"},"content_sha256":"d387423bf404de83a5a5d80ee1ce6b33b2a770cef329b415c2089f7d5146f276","schema_version":"1.0","event_id":"sha256:d387423bf404de83a5a5d80ee1ce6b33b2a770cef329b415c2089f7d5146f276"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A7LCLVHOR3QLQDLBPPVXCA7BTK/bundle.json","state_url":"https://pith.science/pith/A7LCLVHOR3QLQDLBPPVXCA7BTK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A7LCLVHOR3QLQDLBPPVXCA7BTK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T22:10:04Z","links":{"resolver":"https://pith.science/pith/A7LCLVHOR3QLQDLBPPVXCA7BTK","bundle":"https://pith.science/pith/A7LCLVHOR3QLQDLBPPVXCA7BTK/bundle.json","state":"https://pith.science/pith/A7LCLVHOR3QLQDLBPPVXCA7BTK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A7LCLVHOR3QLQDLBPPVXCA7BTK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:A7LCLVHOR3QLQDLBPPVXCA7BTK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8dd68fc43d83786518b7fdcb27e597a2c0374a388336a9a1d9a8ddc9c56ecde5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-24T18:41:00Z","title_canon_sha256":"fdba4cca8360f8288ce9901b3e8e545b4fe72a3a9f17ac714ca272f7f5806844"},"schema_version":"1.0","source":{"id":"1807.09302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09302","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09302v1","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09302","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"A7LCLVHOR3QL","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A7LCLVHOR3QLQDLB","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A7LCLVHO","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:d387423bf404de83a5a5d80ee1ce6b33b2a770cef329b415c2089f7d5146f276","target":"graph","created_at":"2026-05-18T00:09:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hossein Esfandiari, Michael Mitzenmacher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-24T18:41:00Z","title":"Metric Sublinear Algorithms via Linear Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09302","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:07b521455806bbc9ff536c52e5848502d075704201aa4a733e03535e88e400d6","target":"record","created_at":"2026-05-18T00:09:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8dd68fc43d83786518b7fdcb27e597a2c0374a388336a9a1d9a8ddc9c56ecde5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-24T18:41:00Z","title_canon_sha256":"fdba4cca8360f8288ce9901b3e8e545b4fe72a3a9f17ac714ca272f7f5806844"},"schema_version":"1.0","source":{"id":"1807.09302","kind":"arxiv","version":1}},"canonical_sha256":"07d625d4ee8ee0b80d617beb7103e19a8b768292898f44e0c4c5a5495d9da081","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07d625d4ee8ee0b80d617beb7103e19a8b768292898f44e0c4c5a5495d9da081","first_computed_at":"2026-05-18T00:09:51.717049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:51.717049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TIg+ik9HDNJmODkNuG/Wy5IaOM9MvxFVaWpeL5sXTZtTpjLnBfHWCsBVX3gMKWyFLndugGWUn0kx8x7vuDzYDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:51.717647Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.09302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07b521455806bbc9ff536c52e5848502d075704201aa4a733e03535e88e400d6","sha256:d387423bf404de83a5a5d80ee1ce6b33b2a770cef329b415c2089f7d5146f276"],"state_sha256":"98bee74a8b1353a20aff34d01324143976a60b8f935aa0557a8997980c43d53e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OyyNQ0i5vgT2vBEXiO5hLeXEY/wmdPfQJlw8V4r0ohT7a8+jQAAULqo3K71aFbq9b+AkdoVz8yAOlFZpJxWnCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:10:04.720937Z","bundle_sha256":"d6f7bce3563427363f8932ec95a1a47751abebbb62a3ac2a9dfb51a6afe9f4bc"}}