{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FOHO27UVYMKJLJYJYPSVOYKKRC","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":"56188bbb495769893c817b1a91e720390cba59aef0276ba5d409cb4bf40b60db","cross_cats_sorted":["cs.DM","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-29T02:36:20Z","title_canon_sha256":"2ed5b8ad611b5c3f6064d83d3017c5ce2966145b703f2e99bde5d4197991c865"},"schema_version":"1.0","source":{"id":"1310.7665","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7665","created_at":"2026-05-18T02:40:04Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7665v2","created_at":"2026-05-18T02:40:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7665","created_at":"2026-05-18T02:40:04Z"},{"alias_kind":"pith_short_12","alias_value":"FOHO27UVYMKJ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FOHO27UVYMKJLJYJ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FOHO27UV","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:e294f008c22f5d72bad9d2bcb31d8f0da36a234d7d3739b6c03af99973b5e7c4","target":"graph","created_at":"2026-05-18T02:40:04Z","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":"Real-world graphs often manifest as a massive temporal stream of edges. The need for real-time analysis of such large graph streams has led to progress on low memory, one-pass streaming graph algorithms. These algorithms were designed for simple graphs, assuming an edge is not repeated in the stream. Real graph streams however, are almost always multigraphs i.e., they contain many duplicate edges. The assumption of no repeated edges requires an extra pass *storing all the edges* just for deduplication, which defeats the purpose of small memory algorithms.\n  We describe an algorithm for estimat","authors_text":"Ali Pinar, C. Seshadhri, Madhav Jha","cross_cats":["cs.DM","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-29T02:36:20Z","title":"Counting Triangles in Real-World Graph Streams: Dealing with Repeated Edges and Time Windows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7665","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:eaf88f862ef011b5cff87da2431d514c0fd664011d7133512895dcfa137e0524","target":"record","created_at":"2026-05-18T02:40:04Z","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":"56188bbb495769893c817b1a91e720390cba59aef0276ba5d409cb4bf40b60db","cross_cats_sorted":["cs.DM","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-29T02:36:20Z","title_canon_sha256":"2ed5b8ad611b5c3f6064d83d3017c5ce2966145b703f2e99bde5d4197991c865"},"schema_version":"1.0","source":{"id":"1310.7665","kind":"arxiv","version":2}},"canonical_sha256":"2b8eed7e95c31495a709c3e557614a88add28d0d4eb243997e8f029ac30da0c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b8eed7e95c31495a709c3e557614a88add28d0d4eb243997e8f029ac30da0c7","first_computed_at":"2026-05-18T02:40:04.050666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:04.050666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KHxxt+mqQwyTTbU7dctXJojTVkvBBWtqxGAup9VwrvHQNXa48mxoMH6xMvaXdAG5bisUn9M+Jk5KHRxRBH6jDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:04.051169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.7665","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eaf88f862ef011b5cff87da2431d514c0fd664011d7133512895dcfa137e0524","sha256:e294f008c22f5d72bad9d2bcb31d8f0da36a234d7d3739b6c03af99973b5e7c4"],"state_sha256":"5112d58e00abcb5d93828fedab804416bccf530a039d9b0ef4373514bd26fe03"}