{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DLUX5RX7SCWH4P56EUW4UL354P","short_pith_number":"pith:DLUX5RX7","canonical_record":{"source":{"id":"1602.07424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-24T07:39:27Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"3658043ffb3d42c9493dca2b99fa1ca6b7ecfb688f4ffc00d8c2689c08979202","abstract_canon_sha256":"38a21cffce965877b400e740b846cf9f3be3d404cc54bed5dd869c3cf9e7a22c"},"schema_version":"1.0"},"canonical_sha256":"1ae97ec6ff90ac7e3fbe252dca2f7de3cef6a44e35fc41d820f0a6e758847b53","source":{"kind":"arxiv","id":"1602.07424","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07424","created_at":"2026-05-18T01:11:48Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07424v2","created_at":"2026-05-18T01:11:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07424","created_at":"2026-05-18T01:11:48Z"},{"alias_kind":"pith_short_12","alias_value":"DLUX5RX7SCWH","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DLUX5RX7SCWH4P56","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DLUX5RX7","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DLUX5RX7SCWH4P56EUW4UL354P","target":"record","payload":{"canonical_record":{"source":{"id":"1602.07424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-24T07:39:27Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"3658043ffb3d42c9493dca2b99fa1ca6b7ecfb688f4ffc00d8c2689c08979202","abstract_canon_sha256":"38a21cffce965877b400e740b846cf9f3be3d404cc54bed5dd869c3cf9e7a22c"},"schema_version":"1.0"},"canonical_sha256":"1ae97ec6ff90ac7e3fbe252dca2f7de3cef6a44e35fc41d820f0a6e758847b53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:48.484748Z","signature_b64":"XEOJlhDkAiTWrTIk5Wz5uIGFFtWw90CQ93Ndl3SfLWLl08NHZbRX6PA3Wg6sS7pao/s1Hlz+p1KfsnvuNfzSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ae97ec6ff90ac7e3fbe252dca2f7de3cef6a44e35fc41d820f0a6e758847b53","last_reissued_at":"2026-05-18T01:11:48.484424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:48.484424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.07424","source_version":2,"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-18T01:11:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sSNQadNpKbYYYdKnCeD+if80T3zW+HfFUitui/f/ao5ykXohzbvur1QdoctDWnPjRoShjueMRhoaKRoRjMyTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:15:15.521669Z"},"content_sha256":"d3fffbd65559992b44fd1dc61f12e335cbb2c4938ce51b055c66be3f3e625649","schema_version":"1.0","event_id":"sha256:d3fffbd65559992b44fd1dc61f12e335cbb2c4938ce51b055c66be3f3e625649"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DLUX5RX7SCWH4P56EUW4UL354P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TRI\\`EST: Counting Local and Global Triangles in Fully-dynamic Streams with Fixed Memory Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Alessandro Epasto, Eli Upfal, Lorenzo De Stefani, Matteo Riondato","submitted_at":"2016-02-24T07:39:27Z","abstract_excerpt":"We present TRI\\`EST, a suite of one-pass streaming algorithms to compute unbiased, low-variance, high-quality approximations of the global and local (i.e., incident to each vertex) number of triangles in a fully-dynamic graph represented as an adversarial stream of edge insertions and deletions. Our algorithms use reservoir sampling and its variants to exploit the user-specified memory space at all times. This is in contrast with previous approaches which use hard-to-choose parameters (e.g., a fixed sampling probability) and offer no guarantees on the amount of memory they will use. We show a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07424","kind":"arxiv","version":2},"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-18T01:11:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z3m6pTN90l44FWF+exFUXaNr605+/3jxJOLbf7OHjkyVsHxKNmI8nLey2iX73k5LwI4jfqdQSAu9VrZzwqzIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:15:15.522276Z"},"content_sha256":"74ebbb0339a391c0cfcace8e7a25ab6134a30aee4e8618b9dea562ee46451085","schema_version":"1.0","event_id":"sha256:74ebbb0339a391c0cfcace8e7a25ab6134a30aee4e8618b9dea562ee46451085"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DLUX5RX7SCWH4P56EUW4UL354P/bundle.json","state_url":"https://pith.science/pith/DLUX5RX7SCWH4P56EUW4UL354P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DLUX5RX7SCWH4P56EUW4UL354P/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-02T12:15:15Z","links":{"resolver":"https://pith.science/pith/DLUX5RX7SCWH4P56EUW4UL354P","bundle":"https://pith.science/pith/DLUX5RX7SCWH4P56EUW4UL354P/bundle.json","state":"https://pith.science/pith/DLUX5RX7SCWH4P56EUW4UL354P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DLUX5RX7SCWH4P56EUW4UL354P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DLUX5RX7SCWH4P56EUW4UL354P","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":"38a21cffce965877b400e740b846cf9f3be3d404cc54bed5dd869c3cf9e7a22c","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-24T07:39:27Z","title_canon_sha256":"3658043ffb3d42c9493dca2b99fa1ca6b7ecfb688f4ffc00d8c2689c08979202"},"schema_version":"1.0","source":{"id":"1602.07424","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07424","created_at":"2026-05-18T01:11:48Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07424v2","created_at":"2026-05-18T01:11:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07424","created_at":"2026-05-18T01:11:48Z"},{"alias_kind":"pith_short_12","alias_value":"DLUX5RX7SCWH","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DLUX5RX7SCWH4P56","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DLUX5RX7","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:74ebbb0339a391c0cfcace8e7a25ab6134a30aee4e8618b9dea562ee46451085","target":"graph","created_at":"2026-05-18T01:11:48Z","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 present TRI\\`EST, a suite of one-pass streaming algorithms to compute unbiased, low-variance, high-quality approximations of the global and local (i.e., incident to each vertex) number of triangles in a fully-dynamic graph represented as an adversarial stream of edge insertions and deletions. Our algorithms use reservoir sampling and its variants to exploit the user-specified memory space at all times. This is in contrast with previous approaches which use hard-to-choose parameters (e.g., a fixed sampling probability) and offer no guarantees on the amount of memory they will use. We show a ","authors_text":"Alessandro Epasto, Eli Upfal, Lorenzo De Stefani, Matteo Riondato","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-24T07:39:27Z","title":"TRI\\`EST: Counting Local and Global Triangles in Fully-dynamic Streams with Fixed Memory Size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07424","kind":"arxiv","version":2},"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:d3fffbd65559992b44fd1dc61f12e335cbb2c4938ce51b055c66be3f3e625649","target":"record","created_at":"2026-05-18T01:11:48Z","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":"38a21cffce965877b400e740b846cf9f3be3d404cc54bed5dd869c3cf9e7a22c","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-24T07:39:27Z","title_canon_sha256":"3658043ffb3d42c9493dca2b99fa1ca6b7ecfb688f4ffc00d8c2689c08979202"},"schema_version":"1.0","source":{"id":"1602.07424","kind":"arxiv","version":2}},"canonical_sha256":"1ae97ec6ff90ac7e3fbe252dca2f7de3cef6a44e35fc41d820f0a6e758847b53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ae97ec6ff90ac7e3fbe252dca2f7de3cef6a44e35fc41d820f0a6e758847b53","first_computed_at":"2026-05-18T01:11:48.484424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:48.484424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XEOJlhDkAiTWrTIk5Wz5uIGFFtWw90CQ93Ndl3SfLWLl08NHZbRX6PA3Wg6sS7pao/s1Hlz+p1KfsnvuNfzSDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:48.484748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07424","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3fffbd65559992b44fd1dc61f12e335cbb2c4938ce51b055c66be3f3e625649","sha256:74ebbb0339a391c0cfcace8e7a25ab6134a30aee4e8618b9dea562ee46451085"],"state_sha256":"7f184975ba5beda18598544e1fbb26812b00fe15c462911301b06fcddaf334ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yQQVV0dLcvQ6i4DJg4/JkJ/tf/6KFhyv2b3N1cWcvouYjFCkn63+Cko0Uoe+grCmTDoelNGEty529NU0mioeAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:15:15.525176Z","bundle_sha256":"02bdeb4c99295f07b0b684dd205ba2cba3ac14c9c44a89e8d88cf2c6dc890513"}}