{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:F453F7WUI7V5PZMSNYWDMIUEK3","short_pith_number":"pith:F453F7WU","schema_version":"1.0","canonical_sha256":"2f3bb2fed447ebd7e5926e2c36228456c3e5895afd6834a87594032560357a95","source":{"kind":"arxiv","id":"1710.02108","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.02108","created_at":"2026-05-18T00:33:37.510382+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02108v1","created_at":"2026-05-18T00:33:37.510382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02108","created_at":"2026-05-18T00:33:37.510382+00:00"},{"alias_kind":"pith_short_12","alias_value":"F453F7WUI7V5","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"F453F7WUI7V5PZMS","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"F453F7WU","created_at":"2026-05-18T12:31:15.632608+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/F453F7WUI7V5PZMSNYWDMIUEK3","json":"https://pith.science/pith/F453F7WUI7V5PZMSNYWDMIUEK3.json","graph_json":"https://pith.science/api/pith-number/F453F7WUI7V5PZMSNYWDMIUEK3/graph.json","events_json":"https://pith.science/api/pith-number/F453F7WUI7V5PZMSNYWDMIUEK3/events.json","paper":"https://pith.science/paper/F453F7WU"},"agent_actions":{"view_html":"https://pith.science/pith/F453F7WUI7V5PZMSNYWDMIUEK3","download_json":"https://pith.science/pith/F453F7WUI7V5PZMSNYWDMIUEK3.json","view_paper":"https://pith.science/paper/F453F7WU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02108&json=true","fetch_graph":"https://pith.science/api/pith-number/F453F7WUI7V5PZMSNYWDMIUEK3/graph.json","fetch_events":"https://pith.science/api/pith-number/F453F7WUI7V5PZMSNYWDMIUEK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F453F7WUI7V5PZMSNYWDMIUEK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F453F7WUI7V5PZMSNYWDMIUEK3/action/storage_attestation","attest_author":"https://pith.science/pith/F453F7WUI7V5PZMSNYWDMIUEK3/action/author_attestation","sign_citation":"https://pith.science/pith/F453F7WUI7V5PZMSNYWDMIUEK3/action/citation_signature","submit_replication":"https://pith.science/pith/F453F7WUI7V5PZMSNYWDMIUEK3/action/replication_record"}},"created_at":"2026-05-18T00:33:37.510382+00:00","updated_at":"2026-05-18T00:33:37.510382+00:00"}