{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QXPIIW672ZNSOMDAQ2Q77TPB3B","short_pith_number":"pith:QXPIIW67","canonical_record":{"source":{"id":"1703.02625","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-07T22:18:35Z","cross_cats_sorted":["cs.DS","cs.IR","math.ST","stat.TH"],"title_canon_sha256":"b85928545e8652503bebeeaf2911a7b18e5a0992a87c89b26c45b44258f1afb7","abstract_canon_sha256":"994a70f83a34be086651cd264cb520424a1c5848e4f12f5de52b2b3fe0a1684b"},"schema_version":"1.0"},"canonical_sha256":"85de845bdfd65b27306086a1ffcde1d848eae4253ca4071dc43739089c5a82c1","source":{"kind":"arxiv","id":"1703.02625","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02625","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02625v1","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02625","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"pith_short_12","alias_value":"QXPIIW672ZNS","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QXPIIW672ZNSOMDA","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QXPIIW67","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QXPIIW672ZNSOMDAQ2Q77TPB3B","target":"record","payload":{"canonical_record":{"source":{"id":"1703.02625","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-07T22:18:35Z","cross_cats_sorted":["cs.DS","cs.IR","math.ST","stat.TH"],"title_canon_sha256":"b85928545e8652503bebeeaf2911a7b18e5a0992a87c89b26c45b44258f1afb7","abstract_canon_sha256":"994a70f83a34be086651cd264cb520424a1c5848e4f12f5de52b2b3fe0a1684b"},"schema_version":"1.0"},"canonical_sha256":"85de845bdfd65b27306086a1ffcde1d848eae4253ca4071dc43739089c5a82c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:06.004077Z","signature_b64":"5UX97nPt4ZBbIi1zY5QEivZOZi4NLu2uic2xr/q35wXGF6W97ivTfQotyiZ6KarXQTNFOH2Y3wlUs+oBSoMzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85de845bdfd65b27306086a1ffcde1d848eae4253ca4071dc43739089c5a82c1","last_reissued_at":"2026-05-18T00:49:06.003669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:06.003669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.02625","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:49:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bj4SEAdSHMyrjjrk4k18IpqaEFxjp1yNLTpXFbs9MzzWTzJyf82e1pPOxqZh4iTA3lWYn77LDdhWVFeH23OXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:59:57.204987Z"},"content_sha256":"bc3961130d79da9ca7c7219b942835b1cb730c250cb1a744378ea971a67299ed","schema_version":"1.0","event_id":"sha256:bc3961130d79da9ca7c7219b942835b1cb730c250cb1a744378ea971a67299ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QXPIIW672ZNSOMDAQ2Q77TPB3B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Sampling from Massive Graph Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IR","math.ST","stat.TH"],"primary_cat":"cs.SI","authors_text":"Nesreen K. Ahmed, Nick Duffield, Ryan A. Rossi, Theodore Willke","submitted_at":"2017-03-07T22:18:35Z","abstract_excerpt":"We propose Graph Priority Sampling (GPS), a new paradigm for order-based reservoir sampling from massive streams of graph edges. GPS provides a general way to weight edge sampling according to auxiliary and/or size variables so as to accomplish various estimation goals of graph properties. In the context of subgraph counting, we show how edge sampling weights can be chosen so as to minimize the estimation variance of counts of specified sets of subgraphs. In distinction with many prior graph sampling schemes, GPS separates the functions of edge sampling and subgraph estimation. We propose two "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02625","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:49:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zo8j4lBQhSd2G/LiviqQj7/DwAB7YR2jys7SMUrXGwpz1m3WosMIL2fcyh1AB2lqAYMyj22P6BwogqH71O2eCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:59:57.205356Z"},"content_sha256":"3e753e15b1d05cbf4d88f547d33da1a0f6ad8ee9e76738257e614f64dd77d17f","schema_version":"1.0","event_id":"sha256:3e753e15b1d05cbf4d88f547d33da1a0f6ad8ee9e76738257e614f64dd77d17f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXPIIW672ZNSOMDAQ2Q77TPB3B/bundle.json","state_url":"https://pith.science/pith/QXPIIW672ZNSOMDAQ2Q77TPB3B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXPIIW672ZNSOMDAQ2Q77TPB3B/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-03T18:59:57Z","links":{"resolver":"https://pith.science/pith/QXPIIW672ZNSOMDAQ2Q77TPB3B","bundle":"https://pith.science/pith/QXPIIW672ZNSOMDAQ2Q77TPB3B/bundle.json","state":"https://pith.science/pith/QXPIIW672ZNSOMDAQ2Q77TPB3B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXPIIW672ZNSOMDAQ2Q77TPB3B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QXPIIW672ZNSOMDAQ2Q77TPB3B","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":"994a70f83a34be086651cd264cb520424a1c5848e4f12f5de52b2b3fe0a1684b","cross_cats_sorted":["cs.DS","cs.IR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-07T22:18:35Z","title_canon_sha256":"b85928545e8652503bebeeaf2911a7b18e5a0992a87c89b26c45b44258f1afb7"},"schema_version":"1.0","source":{"id":"1703.02625","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02625","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02625v1","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02625","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"pith_short_12","alias_value":"QXPIIW672ZNS","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QXPIIW672ZNSOMDA","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QXPIIW67","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:3e753e15b1d05cbf4d88f547d33da1a0f6ad8ee9e76738257e614f64dd77d17f","target":"graph","created_at":"2026-05-18T00:49:06Z","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 propose Graph Priority Sampling (GPS), a new paradigm for order-based reservoir sampling from massive streams of graph edges. GPS provides a general way to weight edge sampling according to auxiliary and/or size variables so as to accomplish various estimation goals of graph properties. In the context of subgraph counting, we show how edge sampling weights can be chosen so as to minimize the estimation variance of counts of specified sets of subgraphs. In distinction with many prior graph sampling schemes, GPS separates the functions of edge sampling and subgraph estimation. We propose two ","authors_text":"Nesreen K. Ahmed, Nick Duffield, Ryan A. Rossi, Theodore Willke","cross_cats":["cs.DS","cs.IR","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-07T22:18:35Z","title":"On Sampling from Massive Graph Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02625","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:bc3961130d79da9ca7c7219b942835b1cb730c250cb1a744378ea971a67299ed","target":"record","created_at":"2026-05-18T00:49:06Z","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":"994a70f83a34be086651cd264cb520424a1c5848e4f12f5de52b2b3fe0a1684b","cross_cats_sorted":["cs.DS","cs.IR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-07T22:18:35Z","title_canon_sha256":"b85928545e8652503bebeeaf2911a7b18e5a0992a87c89b26c45b44258f1afb7"},"schema_version":"1.0","source":{"id":"1703.02625","kind":"arxiv","version":1}},"canonical_sha256":"85de845bdfd65b27306086a1ffcde1d848eae4253ca4071dc43739089c5a82c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85de845bdfd65b27306086a1ffcde1d848eae4253ca4071dc43739089c5a82c1","first_computed_at":"2026-05-18T00:49:06.003669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:06.003669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5UX97nPt4ZBbIi1zY5QEivZOZi4NLu2uic2xr/q35wXGF6W97ivTfQotyiZ6KarXQTNFOH2Y3wlUs+oBSoMzDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:06.004077Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02625","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc3961130d79da9ca7c7219b942835b1cb730c250cb1a744378ea971a67299ed","sha256:3e753e15b1d05cbf4d88f547d33da1a0f6ad8ee9e76738257e614f64dd77d17f"],"state_sha256":"48e2ed7afe555a9182539ae86644122291f9cf121721d7634c48fee3ff0da1d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9k0QmR2fz9ua/4pEdAyNBpQo479L+gOc6Tv2fw8HTKBVpHsZxzztw13ErZLO0Ee0ZsH2mCITqTwv04bheMzBCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:59:57.207380Z","bundle_sha256":"8ecb5716c59803682ee450400a7b9a419201b00667c673dd56990e04d9969c9f"}}