{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:F453F7WUI7V5PZMSNYWDMIUEK3","short_pith_number":"pith:F453F7WU","canonical_record":{"source":{"id":"1710.02108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-05T16:46:59Z","cross_cats_sorted":[],"title_canon_sha256":"b359b91ed2f8d5bc2d2456f70f03e6650d6b456a67186b7fd66638b6922c9041","abstract_canon_sha256":"b79046765e7ff8e91b7c8ab7e69f3684057d97c512160fc1e7c9990b75d305f3"},"schema_version":"1.0"},"canonical_sha256":"2f3bb2fed447ebd7e5926e2c36228456c3e5895afd6834a87594032560357a95","source":{"kind":"arxiv","id":"1710.02108","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02108","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02108v1","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02108","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"F453F7WUI7V5","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F453F7WUI7V5PZMS","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F453F7WU","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:F453F7WUI7V5PZMSNYWDMIUEK3","target":"record","payload":{"canonical_record":{"source":{"id":"1710.02108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-05T16:46:59Z","cross_cats_sorted":[],"title_canon_sha256":"b359b91ed2f8d5bc2d2456f70f03e6650d6b456a67186b7fd66638b6922c9041","abstract_canon_sha256":"b79046765e7ff8e91b7c8ab7e69f3684057d97c512160fc1e7c9990b75d305f3"},"schema_version":"1.0"},"canonical_sha256":"2f3bb2fed447ebd7e5926e2c36228456c3e5895afd6834a87594032560357a95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:37.510967Z","signature_b64":"M91JabKSskS59s7G4k6SxMBB4KW5jzMSlpon5bIqnRLyPjEF9ltG6REEHKfGtF5gmRgN64f8lh9MFeyE+lPzCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f3bb2fed447ebd7e5926e2c36228456c3e5895afd6834a87594032560357a95","last_reissued_at":"2026-05-18T00:33:37.510257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:37.510257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.02108","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:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yv9sRhkCPxZF6PBBzOf3XG64pe1xqrJho9zuxf8nFq14bmwSJLGQ7sNrqqojnF8rWmOeF/z/BZBCIL1TL0PBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:19:51.116758Z"},"content_sha256":"af32ead92f9fd876eaebc45b555c29b85e7ebd2d4543a7b26cfcaaadad4230c6","schema_version":"1.0","event_id":"sha256:af32ead92f9fd876eaebc45b555c29b85e7ebd2d4543a7b26cfcaaadad4230c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:F453F7WUI7V5PZMSNYWDMIUEK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tiered Sampling: An Efficient Method for Approximate Counting Sparse Motifs in Massive Graph Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eli Upfal, Erisa Terolli, Lorenzo De Stefani","submitted_at":"2017-10-05T16:46:59Z","abstract_excerpt":"We introduce Tiered Sampling, a novel technique for approximate counting sparse motifs in massive graphs whose edges are observed in a stream. Our technique requires only a single pass on the data and uses a memory of fixed size $M$, which can be magnitudes smaller than the number of edges.\n  Our methods addresses the challenging task of counting sparse motifs - sub-graph patterns that have low probability to appear in a sample of $M$ edges in the graph, which is the maximum amount of data available to the algorithms in each step. To obtain an unbiased and low variance estimate of the count we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02108","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:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mqdT8n0mQCjwMyfc19NLV72JZ7oaXK+ZFsq1XSZ0LMR7pSK8kP50/IrCx2+191AZdjCobfRUsNPub1f0Hc1NBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:19:51.117102Z"},"content_sha256":"0532187084116f57e274b4453a249a2f0695896693bb5f64367b4ffe08d67a63","schema_version":"1.0","event_id":"sha256:0532187084116f57e274b4453a249a2f0695896693bb5f64367b4ffe08d67a63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F453F7WUI7V5PZMSNYWDMIUEK3/bundle.json","state_url":"https://pith.science/pith/F453F7WUI7V5PZMSNYWDMIUEK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F453F7WUI7V5PZMSNYWDMIUEK3/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-02T10:19:51Z","links":{"resolver":"https://pith.science/pith/F453F7WUI7V5PZMSNYWDMIUEK3","bundle":"https://pith.science/pith/F453F7WUI7V5PZMSNYWDMIUEK3/bundle.json","state":"https://pith.science/pith/F453F7WUI7V5PZMSNYWDMIUEK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F453F7WUI7V5PZMSNYWDMIUEK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:F453F7WUI7V5PZMSNYWDMIUEK3","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":"b79046765e7ff8e91b7c8ab7e69f3684057d97c512160fc1e7c9990b75d305f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-05T16:46:59Z","title_canon_sha256":"b359b91ed2f8d5bc2d2456f70f03e6650d6b456a67186b7fd66638b6922c9041"},"schema_version":"1.0","source":{"id":"1710.02108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02108","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02108v1","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02108","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"F453F7WUI7V5","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F453F7WUI7V5PZMS","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F453F7WU","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:0532187084116f57e274b4453a249a2f0695896693bb5f64367b4ffe08d67a63","target":"graph","created_at":"2026-05-18T00:33:37Z","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 introduce Tiered Sampling, a novel technique for approximate counting sparse motifs in massive graphs whose edges are observed in a stream. Our technique requires only a single pass on the data and uses a memory of fixed size $M$, which can be magnitudes smaller than the number of edges.\n  Our methods addresses the challenging task of counting sparse motifs - sub-graph patterns that have low probability to appear in a sample of $M$ edges in the graph, which is the maximum amount of data available to the algorithms in each step. To obtain an unbiased and low variance estimate of the count we","authors_text":"Eli Upfal, Erisa Terolli, Lorenzo De Stefani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-05T16:46:59Z","title":"Tiered Sampling: An Efficient Method for Approximate Counting Sparse Motifs in Massive Graph Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02108","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:af32ead92f9fd876eaebc45b555c29b85e7ebd2d4543a7b26cfcaaadad4230c6","target":"record","created_at":"2026-05-18T00:33:37Z","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":"b79046765e7ff8e91b7c8ab7e69f3684057d97c512160fc1e7c9990b75d305f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-05T16:46:59Z","title_canon_sha256":"b359b91ed2f8d5bc2d2456f70f03e6650d6b456a67186b7fd66638b6922c9041"},"schema_version":"1.0","source":{"id":"1710.02108","kind":"arxiv","version":1}},"canonical_sha256":"2f3bb2fed447ebd7e5926e2c36228456c3e5895afd6834a87594032560357a95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f3bb2fed447ebd7e5926e2c36228456c3e5895afd6834a87594032560357a95","first_computed_at":"2026-05-18T00:33:37.510257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:37.510257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M91JabKSskS59s7G4k6SxMBB4KW5jzMSlpon5bIqnRLyPjEF9ltG6REEHKfGtF5gmRgN64f8lh9MFeyE+lPzCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:37.510967Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.02108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af32ead92f9fd876eaebc45b555c29b85e7ebd2d4543a7b26cfcaaadad4230c6","sha256:0532187084116f57e274b4453a249a2f0695896693bb5f64367b4ffe08d67a63"],"state_sha256":"55eb5a5ae30d215b3cf040c2b6a74d6de8f2df6fcb66df1b17db0676ee1bb8cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sYhVtDfsuYquN4zvpEdj00Lr30hnFqu2fa5QAfPA9eLHI36b8gnM6lqjqKf+OozCXmC9SnXgq10aPDa8NbpWCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:19:51.119531Z","bundle_sha256":"9f95c5be22eec55aed9ac9124627d47882b4a8e022691c1bebbc7b2e17f71486"}}