{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DLUX5RX7SCWH4P56EUW4UL354P","short_pith_number":"pith:DLUX5RX7","schema_version":"1.0","canonical_sha256":"1ae97ec6ff90ac7e3fbe252dca2f7de3cef6a44e35fc41d820f0a6e758847b53","source":{"kind":"arxiv","id":"1602.07424","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.07424","created_at":"2026-05-18T01:11:48.484476+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07424v2","created_at":"2026-05-18T01:11:48.484476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07424","created_at":"2026-05-18T01:11:48.484476+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLUX5RX7SCWH","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLUX5RX7SCWH4P56","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLUX5RX7","created_at":"2026-05-18T12:30:12.583610+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/DLUX5RX7SCWH4P56EUW4UL354P","json":"https://pith.science/pith/DLUX5RX7SCWH4P56EUW4UL354P.json","graph_json":"https://pith.science/api/pith-number/DLUX5RX7SCWH4P56EUW4UL354P/graph.json","events_json":"https://pith.science/api/pith-number/DLUX5RX7SCWH4P56EUW4UL354P/events.json","paper":"https://pith.science/paper/DLUX5RX7"},"agent_actions":{"view_html":"https://pith.science/pith/DLUX5RX7SCWH4P56EUW4UL354P","download_json":"https://pith.science/pith/DLUX5RX7SCWH4P56EUW4UL354P.json","view_paper":"https://pith.science/paper/DLUX5RX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07424&json=true","fetch_graph":"https://pith.science/api/pith-number/DLUX5RX7SCWH4P56EUW4UL354P/graph.json","fetch_events":"https://pith.science/api/pith-number/DLUX5RX7SCWH4P56EUW4UL354P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLUX5RX7SCWH4P56EUW4UL354P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLUX5RX7SCWH4P56EUW4UL354P/action/storage_attestation","attest_author":"https://pith.science/pith/DLUX5RX7SCWH4P56EUW4UL354P/action/author_attestation","sign_citation":"https://pith.science/pith/DLUX5RX7SCWH4P56EUW4UL354P/action/citation_signature","submit_replication":"https://pith.science/pith/DLUX5RX7SCWH4P56EUW4UL354P/action/replication_record"}},"created_at":"2026-05-18T01:11:48.484476+00:00","updated_at":"2026-05-18T01:11:48.484476+00:00"}