{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:E6KBZGQUY6JZJV34HNBM5FRTND","short_pith_number":"pith:E6KBZGQU","canonical_record":{"source":{"id":"1404.4696","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-18T06:18:07Z","cross_cats_sorted":[],"title_canon_sha256":"6be93688afeb18b558eaea03f9eea11a319dd416c46fe59374d827ab3996997a","abstract_canon_sha256":"406666deda7274481c04cc0eea13333613d48f46be88fbf286f97d565789d2fd"},"schema_version":"1.0"},"canonical_sha256":"27941c9a14c79394d77c3b42ce963368c9378682c1a10ea4155105b80e70060a","source":{"kind":"arxiv","id":"1404.4696","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4696","created_at":"2026-05-18T01:36:58Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4696v5","created_at":"2026-05-18T01:36:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4696","created_at":"2026-05-18T01:36:58Z"},{"alias_kind":"pith_short_12","alias_value":"E6KBZGQUY6JZ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E6KBZGQUY6JZJV34","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E6KBZGQU","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:E6KBZGQUY6JZJV34HNBM5FRTND","target":"record","payload":{"canonical_record":{"source":{"id":"1404.4696","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-18T06:18:07Z","cross_cats_sorted":[],"title_canon_sha256":"6be93688afeb18b558eaea03f9eea11a319dd416c46fe59374d827ab3996997a","abstract_canon_sha256":"406666deda7274481c04cc0eea13333613d48f46be88fbf286f97d565789d2fd"},"schema_version":"1.0"},"canonical_sha256":"27941c9a14c79394d77c3b42ce963368c9378682c1a10ea4155105b80e70060a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:58.411198Z","signature_b64":"ZDNxBzw4nClu4xeGIeRfwUUcwJq9kx47ftTBTkbrHTVVV9A4giQXJYRlF6IMr+meDDc54DUgD/vTPT+IleSVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27941c9a14c79394d77c3b42ce963368c9378682c1a10ea4155105b80e70060a","last_reissued_at":"2026-05-18T01:36:58.410584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:58.410584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.4696","source_version":5,"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:36:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mr0ujvPpuJfKPPMB7fXYEjyZpoRzjOfzWuQRjJjWmRjffhdF6i0acR0C3fNyQdeFJiTt5EYfoiuk09tvDy9JDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:34:27.561672Z"},"content_sha256":"a5dac33d3a4716167d9c1dec6f55cc6967e62f1355ef2b757fbacc5aa7a9f09b","schema_version":"1.0","event_id":"sha256:a5dac33d3a4716167d9c1dec6f55cc6967e62f1355ef2b757fbacc5aa7a9f09b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:E6KBZGQUY6JZJV34HNBM5FRTND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Triangle counting in dynamic graph streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Konstantin Kutzkov, Laurent Bulteau, Rasmus Pagh, Vincent Froese","submitted_at":"2014-04-18T06:18:07Z","abstract_excerpt":"Estimating the number of triangles in graph streams using a limited amount of memory has become a popular topic in the last decade. Different variations of the problem have been studied, depending on whether the graph edges are provided in an arbitrary order or as incidence lists. However, with a few exceptions, the algorithms have considered {\\em insert-only} streams. We present a new algorithm estimating the number of triangles in {\\em dynamic} graph streams where edges can be both inserted and deleted. We show that our algorithm achieves better time and space complexity than previous soluti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4696","kind":"arxiv","version":5},"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:36:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1vyC/Zzm3Pf4PLuyUgP/yTPlvK3LTm0xJtMW01mbcT+hicsnpYmBcSBWFN8TyNH7CSnCF8V5k0YF/SCS/2kXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:34:27.562016Z"},"content_sha256":"c8a26a0cf8cc5664ccb534c9b61b801868887fd24cebae676fa649e4adb42163","schema_version":"1.0","event_id":"sha256:c8a26a0cf8cc5664ccb534c9b61b801868887fd24cebae676fa649e4adb42163"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E6KBZGQUY6JZJV34HNBM5FRTND/bundle.json","state_url":"https://pith.science/pith/E6KBZGQUY6JZJV34HNBM5FRTND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E6KBZGQUY6JZJV34HNBM5FRTND/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-20T09:34:27Z","links":{"resolver":"https://pith.science/pith/E6KBZGQUY6JZJV34HNBM5FRTND","bundle":"https://pith.science/pith/E6KBZGQUY6JZJV34HNBM5FRTND/bundle.json","state":"https://pith.science/pith/E6KBZGQUY6JZJV34HNBM5FRTND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E6KBZGQUY6JZJV34HNBM5FRTND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:E6KBZGQUY6JZJV34HNBM5FRTND","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":"406666deda7274481c04cc0eea13333613d48f46be88fbf286f97d565789d2fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-18T06:18:07Z","title_canon_sha256":"6be93688afeb18b558eaea03f9eea11a319dd416c46fe59374d827ab3996997a"},"schema_version":"1.0","source":{"id":"1404.4696","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4696","created_at":"2026-05-18T01:36:58Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4696v5","created_at":"2026-05-18T01:36:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4696","created_at":"2026-05-18T01:36:58Z"},{"alias_kind":"pith_short_12","alias_value":"E6KBZGQUY6JZ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E6KBZGQUY6JZJV34","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E6KBZGQU","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:c8a26a0cf8cc5664ccb534c9b61b801868887fd24cebae676fa649e4adb42163","target":"graph","created_at":"2026-05-18T01:36:58Z","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":"Estimating the number of triangles in graph streams using a limited amount of memory has become a popular topic in the last decade. Different variations of the problem have been studied, depending on whether the graph edges are provided in an arbitrary order or as incidence lists. However, with a few exceptions, the algorithms have considered {\\em insert-only} streams. We present a new algorithm estimating the number of triangles in {\\em dynamic} graph streams where edges can be both inserted and deleted. We show that our algorithm achieves better time and space complexity than previous soluti","authors_text":"Konstantin Kutzkov, Laurent Bulteau, Rasmus Pagh, Vincent Froese","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-18T06:18:07Z","title":"Triangle counting in dynamic graph streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4696","kind":"arxiv","version":5},"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:a5dac33d3a4716167d9c1dec6f55cc6967e62f1355ef2b757fbacc5aa7a9f09b","target":"record","created_at":"2026-05-18T01:36:58Z","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":"406666deda7274481c04cc0eea13333613d48f46be88fbf286f97d565789d2fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-18T06:18:07Z","title_canon_sha256":"6be93688afeb18b558eaea03f9eea11a319dd416c46fe59374d827ab3996997a"},"schema_version":"1.0","source":{"id":"1404.4696","kind":"arxiv","version":5}},"canonical_sha256":"27941c9a14c79394d77c3b42ce963368c9378682c1a10ea4155105b80e70060a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27941c9a14c79394d77c3b42ce963368c9378682c1a10ea4155105b80e70060a","first_computed_at":"2026-05-18T01:36:58.410584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:58.410584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZDNxBzw4nClu4xeGIeRfwUUcwJq9kx47ftTBTkbrHTVVV9A4giQXJYRlF6IMr+meDDc54DUgD/vTPT+IleSVCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:58.411198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4696","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5dac33d3a4716167d9c1dec6f55cc6967e62f1355ef2b757fbacc5aa7a9f09b","sha256:c8a26a0cf8cc5664ccb534c9b61b801868887fd24cebae676fa649e4adb42163"],"state_sha256":"02657891bbbbf259b18e789df1cff4f39570ebb0559546a76982f1e7fe2a94cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YVeOCh193x884Jj2gFHgendBLp8CxPZTUKLRH6pKc7lfOG1keJ0Pt1ypXooMUKnp74MUdqz2kATfOL61VLZADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T09:34:27.563965Z","bundle_sha256":"913cc8ea19357ac7fea019ebb5e72792777119d7812143f8afecee8f22834f6f"}}