{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4QXRI45LIDWLDGA6XZ7QAQO7DM","short_pith_number":"pith:4QXRI45L","canonical_record":{"source":{"id":"1706.05554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-17T16:00:44Z","cross_cats_sorted":[],"title_canon_sha256":"6f4c8a4969b7ec908b1df562b596f13988a4daefccad6e01488ba906dced82d3","abstract_canon_sha256":"a1081c8a02a0452f00ffad6361f45243777455a312882f8261fcde81c30b49f5"},"schema_version":"1.0"},"canonical_sha256":"e42f1473ab40ecb1981ebe7f0041df1b0eab72fddab6f7868504964c12218918","source":{"kind":"arxiv","id":"1706.05554","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05554","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05554v1","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05554","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"4QXRI45LIDWL","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4QXRI45LIDWLDGA6","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4QXRI45L","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4QXRI45LIDWLDGA6XZ7QAQO7DM","target":"record","payload":{"canonical_record":{"source":{"id":"1706.05554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-17T16:00:44Z","cross_cats_sorted":[],"title_canon_sha256":"6f4c8a4969b7ec908b1df562b596f13988a4daefccad6e01488ba906dced82d3","abstract_canon_sha256":"a1081c8a02a0452f00ffad6361f45243777455a312882f8261fcde81c30b49f5"},"schema_version":"1.0"},"canonical_sha256":"e42f1473ab40ecb1981ebe7f0041df1b0eab72fddab6f7868504964c12218918","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:09.534861Z","signature_b64":"Okaeo7eAM4VjJnT2svfAQ0GStEMnv78BiS2zL79MG90QPVZVTREw3xVEMClcKGd1eODXj3Cl49LYjg9SfRbzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e42f1473ab40ecb1981ebe7f0041df1b0eab72fddab6f7868504964c12218918","last_reissued_at":"2026-05-18T00:42:09.534396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:09.534396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.05554","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:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qjb4cLUSlyZu/AJsF1nQC2xyRFOEHo/c6lj1a7a5Isk5Jo7GTpVek9W3yRgdOhe9yRZuy5O2mGsY4WMdk03uAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T20:09:53.317350Z"},"content_sha256":"f0e2032c9eab3dc486835f917e059ce5b269f902a212349e4f950ac58f30c523","schema_version":"1.0","event_id":"sha256:f0e2032c9eab3dc486835f917e059ce5b269f902a212349e4f950ac58f30c523"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4QXRI45LIDWLDGA6XZ7QAQO7DM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coresets for Vector Summarization with Applications to Network Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dan Feldman, Daniela Rus, Sedat Ozer","submitted_at":"2017-06-17T16:00:44Z","abstract_excerpt":"We provide a deterministic data summarization algorithm that approximates the mean $\\bar{p}=\\frac{1}{n}\\sum_{p\\in P} p$ of a set $P$ of $n$ vectors in $\\REAL^d$, by a weighted mean $\\tilde{p}$ of a \\emph{subset} of $O(1/\\eps)$ vectors, i.e., independent of both $n$ and $d$. We prove that the squared Euclidean distance between $\\bar{p}$ and $\\tilde{p}$ is at most $\\eps$ multiplied by the variance of $P$. We use this algorithm to maintain an approximated sum of vectors from an unbounded stream, using memory that is independent of $d$, and logarithmic in the $n$ vectors seen so far. Our main appl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05554","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:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CeHXV1xewU/oHAiZounpLw7m8bI0LwGsPT8YJhtL3ldlcalitkS/hE2o8mX/PIgGPQu6jMnGtN8/rmz1yznqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T20:09:53.318050Z"},"content_sha256":"89123365b434387bb0eac75c68aa653d289efae870b61dbd635ab46fe61bb099","schema_version":"1.0","event_id":"sha256:89123365b434387bb0eac75c68aa653d289efae870b61dbd635ab46fe61bb099"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4QXRI45LIDWLDGA6XZ7QAQO7DM/bundle.json","state_url":"https://pith.science/pith/4QXRI45LIDWLDGA6XZ7QAQO7DM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4QXRI45LIDWLDGA6XZ7QAQO7DM/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-05-20T20:09:53Z","links":{"resolver":"https://pith.science/pith/4QXRI45LIDWLDGA6XZ7QAQO7DM","bundle":"https://pith.science/pith/4QXRI45LIDWLDGA6XZ7QAQO7DM/bundle.json","state":"https://pith.science/pith/4QXRI45LIDWLDGA6XZ7QAQO7DM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4QXRI45LIDWLDGA6XZ7QAQO7DM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4QXRI45LIDWLDGA6XZ7QAQO7DM","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":"a1081c8a02a0452f00ffad6361f45243777455a312882f8261fcde81c30b49f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-17T16:00:44Z","title_canon_sha256":"6f4c8a4969b7ec908b1df562b596f13988a4daefccad6e01488ba906dced82d3"},"schema_version":"1.0","source":{"id":"1706.05554","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05554","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05554v1","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05554","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"4QXRI45LIDWL","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4QXRI45LIDWLDGA6","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4QXRI45L","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:89123365b434387bb0eac75c68aa653d289efae870b61dbd635ab46fe61bb099","target":"graph","created_at":"2026-05-18T00:42:09Z","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":"We provide a deterministic data summarization algorithm that approximates the mean $\\bar{p}=\\frac{1}{n}\\sum_{p\\in P} p$ of a set $P$ of $n$ vectors in $\\REAL^d$, by a weighted mean $\\tilde{p}$ of a \\emph{subset} of $O(1/\\eps)$ vectors, i.e., independent of both $n$ and $d$. We prove that the squared Euclidean distance between $\\bar{p}$ and $\\tilde{p}$ is at most $\\eps$ multiplied by the variance of $P$. We use this algorithm to maintain an approximated sum of vectors from an unbounded stream, using memory that is independent of $d$, and logarithmic in the $n$ vectors seen so far. Our main appl","authors_text":"Dan Feldman, Daniela Rus, Sedat Ozer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-17T16:00:44Z","title":"Coresets for Vector Summarization with Applications to Network Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05554","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:f0e2032c9eab3dc486835f917e059ce5b269f902a212349e4f950ac58f30c523","target":"record","created_at":"2026-05-18T00:42:09Z","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":"a1081c8a02a0452f00ffad6361f45243777455a312882f8261fcde81c30b49f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-17T16:00:44Z","title_canon_sha256":"6f4c8a4969b7ec908b1df562b596f13988a4daefccad6e01488ba906dced82d3"},"schema_version":"1.0","source":{"id":"1706.05554","kind":"arxiv","version":1}},"canonical_sha256":"e42f1473ab40ecb1981ebe7f0041df1b0eab72fddab6f7868504964c12218918","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e42f1473ab40ecb1981ebe7f0041df1b0eab72fddab6f7868504964c12218918","first_computed_at":"2026-05-18T00:42:09.534396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:09.534396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Okaeo7eAM4VjJnT2svfAQ0GStEMnv78BiS2zL79MG90QPVZVTREw3xVEMClcKGd1eODXj3Cl49LYjg9SfRbzCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:09.534861Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05554","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0e2032c9eab3dc486835f917e059ce5b269f902a212349e4f950ac58f30c523","sha256:89123365b434387bb0eac75c68aa653d289efae870b61dbd635ab46fe61bb099"],"state_sha256":"42dc991570f4dcdb612f8e9e1713acc46868e30931c535e621e32fc5eecb4eeb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1u0fuWMC3PUdcIHO9FjUGF9zIRsEg1MGbHViX7YaPIPMH1zSfrnWkzusuGBenXY35dQRW6znuFoUd77ttLdTDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T20:09:53.321802Z","bundle_sha256":"28f7a884860189ec26d8596a9ab47ca669da523f02752ceff99f1b7c3c9c8e41"}}