{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6T3BHHAOWF5RCR7DQKZ7W6GP5C","short_pith_number":"pith:6T3BHHAO","canonical_record":{"source":{"id":"1605.00089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-30T10:17:30Z","cross_cats_sorted":[],"title_canon_sha256":"a50fdbaf05de1167650068959268add168ddf889ac2e021020e011c65def2ab2","abstract_canon_sha256":"2dc00b641f7a020940de3dae3bfeb44c0a3e7ed1049812fefd23b8c5a94c7f40"},"schema_version":"1.0"},"canonical_sha256":"f4f6139c0eb17b1147e382b3fb78cfe8b4b4d0759fb702cc7216938ade2fd904","source":{"kind":"arxiv","id":"1605.00089","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00089","created_at":"2026-05-18T01:15:56Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00089v1","created_at":"2026-05-18T01:15:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00089","created_at":"2026-05-18T01:15:56Z"},{"alias_kind":"pith_short_12","alias_value":"6T3BHHAOWF5R","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6T3BHHAOWF5RCR7D","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6T3BHHAO","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6T3BHHAOWF5RCR7DQKZ7W6GP5C","target":"record","payload":{"canonical_record":{"source":{"id":"1605.00089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-30T10:17:30Z","cross_cats_sorted":[],"title_canon_sha256":"a50fdbaf05de1167650068959268add168ddf889ac2e021020e011c65def2ab2","abstract_canon_sha256":"2dc00b641f7a020940de3dae3bfeb44c0a3e7ed1049812fefd23b8c5a94c7f40"},"schema_version":"1.0"},"canonical_sha256":"f4f6139c0eb17b1147e382b3fb78cfe8b4b4d0759fb702cc7216938ade2fd904","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:56.885302Z","signature_b64":"dKKuQ/w5lqehvvs2ivb7m2ib4sbtRHqEK5Gq49cdJnmQrsAfdoMK4LJN4pqNiiz4vLHcDo9iGfeNDOAFPpM6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4f6139c0eb17b1147e382b3fb78cfe8b4b4d0759fb702cc7216938ade2fd904","last_reissued_at":"2026-05-18T01:15:56.884771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:56.884771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.00089","source_version":1,"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:15:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oQNiTjnooz59jt0J3eNIZOfDtNAtgFYwyvxCLDvbTvvhwwzQ6kVbRU0yBIIW9uog9qaFOzfwgCO+YbPng5kUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:19:38.130596Z"},"content_sha256":"36812fa68f51fce85f65ccfb20a46cd32a2809657c0a021fe5119418e3d2c6c7","schema_version":"1.0","event_id":"sha256:36812fa68f51fce85f65ccfb20a46cd32a2809657c0a021fe5119418e3d2c6c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6T3BHHAOWF5RCR7DQKZ7W6GP5C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Graph Stream Algorithms in $o(n)$ Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pan Peng, Zengfeng Huang","submitted_at":"2016-04-30T10:17:30Z","abstract_excerpt":"In this paper we study graph problems in dynamic streaming model, where the input is defined by a sequence of edge insertions and deletions. As many natural problems require $\\Omega(n)$ space, where $n$ is the number of vertices, existing works mainly focused on designing $\\tilde{O}(n)$ space algorithms. Although sublinear in the number of edges for dense graphs, it could still be too large for many applications (e.g. $n$ is huge or the graph is sparse). In this work, we give single-pass algorithms beating this space barrier for two classes of problems.\n  We present $o(n)$ space algorithms for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00089","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"},"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:15:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H5ETLdywP7Dsf/Gaamn9lgUSWinZiRFI+h+rFCnaKW9A2wFn2Rnuw1MxouMof8d04W5lEN2fHwYh0O8xuX4xDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:19:38.131248Z"},"content_sha256":"ff87928cbdecd30e732577410da6a756b42977b334daf6030e52f7948f21fcde","schema_version":"1.0","event_id":"sha256:ff87928cbdecd30e732577410da6a756b42977b334daf6030e52f7948f21fcde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6T3BHHAOWF5RCR7DQKZ7W6GP5C/bundle.json","state_url":"https://pith.science/pith/6T3BHHAOWF5RCR7DQKZ7W6GP5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6T3BHHAOWF5RCR7DQKZ7W6GP5C/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-05T05:19:38Z","links":{"resolver":"https://pith.science/pith/6T3BHHAOWF5RCR7DQKZ7W6GP5C","bundle":"https://pith.science/pith/6T3BHHAOWF5RCR7DQKZ7W6GP5C/bundle.json","state":"https://pith.science/pith/6T3BHHAOWF5RCR7DQKZ7W6GP5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6T3BHHAOWF5RCR7DQKZ7W6GP5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6T3BHHAOWF5RCR7DQKZ7W6GP5C","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":"2dc00b641f7a020940de3dae3bfeb44c0a3e7ed1049812fefd23b8c5a94c7f40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-30T10:17:30Z","title_canon_sha256":"a50fdbaf05de1167650068959268add168ddf889ac2e021020e011c65def2ab2"},"schema_version":"1.0","source":{"id":"1605.00089","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00089","created_at":"2026-05-18T01:15:56Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00089v1","created_at":"2026-05-18T01:15:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00089","created_at":"2026-05-18T01:15:56Z"},{"alias_kind":"pith_short_12","alias_value":"6T3BHHAOWF5R","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6T3BHHAOWF5RCR7D","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6T3BHHAO","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:ff87928cbdecd30e732577410da6a756b42977b334daf6030e52f7948f21fcde","target":"graph","created_at":"2026-05-18T01:15:56Z","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":"In this paper we study graph problems in dynamic streaming model, where the input is defined by a sequence of edge insertions and deletions. As many natural problems require $\\Omega(n)$ space, where $n$ is the number of vertices, existing works mainly focused on designing $\\tilde{O}(n)$ space algorithms. Although sublinear in the number of edges for dense graphs, it could still be too large for many applications (e.g. $n$ is huge or the graph is sparse). In this work, we give single-pass algorithms beating this space barrier for two classes of problems.\n  We present $o(n)$ space algorithms for","authors_text":"Pan Peng, Zengfeng Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-30T10:17:30Z","title":"Dynamic Graph Stream Algorithms in $o(n)$ Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00089","kind":"arxiv","version":1},"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:36812fa68f51fce85f65ccfb20a46cd32a2809657c0a021fe5119418e3d2c6c7","target":"record","created_at":"2026-05-18T01:15:56Z","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":"2dc00b641f7a020940de3dae3bfeb44c0a3e7ed1049812fefd23b8c5a94c7f40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-30T10:17:30Z","title_canon_sha256":"a50fdbaf05de1167650068959268add168ddf889ac2e021020e011c65def2ab2"},"schema_version":"1.0","source":{"id":"1605.00089","kind":"arxiv","version":1}},"canonical_sha256":"f4f6139c0eb17b1147e382b3fb78cfe8b4b4d0759fb702cc7216938ade2fd904","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4f6139c0eb17b1147e382b3fb78cfe8b4b4d0759fb702cc7216938ade2fd904","first_computed_at":"2026-05-18T01:15:56.884771Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:56.884771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dKKuQ/w5lqehvvs2ivb7m2ib4sbtRHqEK5Gq49cdJnmQrsAfdoMK4LJN4pqNiiz4vLHcDo9iGfeNDOAFPpM6DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:56.885302Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.00089","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36812fa68f51fce85f65ccfb20a46cd32a2809657c0a021fe5119418e3d2c6c7","sha256:ff87928cbdecd30e732577410da6a756b42977b334daf6030e52f7948f21fcde"],"state_sha256":"35efc94f57759421cade6fa465b546ccfb3277a091863a87440ade1333df7bc7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tZtIUmA5q33Vcn6fYrnmLB4B6Is777uUo+PcMmDrfJt0vsfNh1oVy5Z4wvwGgh/CxuDEknAabYU40o5OY7DvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:19:38.134913Z","bundle_sha256":"ccec447dec9cc9fa54d7e9e68b7b4b315b3cafa1b71673315b3d74a223a5ba73"}}