{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JSNBXCOBJ2RGACAMEGCMOWIEX5","short_pith_number":"pith:JSNBXCOB","canonical_record":{"source":{"id":"1407.3462","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-13T13:19:07Z","cross_cats_sorted":[],"title_canon_sha256":"be1fcb66794dd78698f982d04ad682a5dfeba6973fac968c2321ec3f9d2a8b3c","abstract_canon_sha256":"0652cc0ac449b5ec3fd37736a61c51a726dc5100b71c61b2df4693ebeb8a0738"},"schema_version":"1.0"},"canonical_sha256":"4c9a1b89c14ea260080c2184c75904bf7d75e4fc442908e1b26bce4966f7c1ba","source":{"kind":"arxiv","id":"1407.3462","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3462","created_at":"2026-05-18T01:35:35Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3462v2","created_at":"2026-05-18T01:35:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3462","created_at":"2026-05-18T01:35:35Z"},{"alias_kind":"pith_short_12","alias_value":"JSNBXCOBJ2RG","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JSNBXCOBJ2RGACAM","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JSNBXCOB","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JSNBXCOBJ2RGACAMEGCMOWIEX5","target":"record","payload":{"canonical_record":{"source":{"id":"1407.3462","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-13T13:19:07Z","cross_cats_sorted":[],"title_canon_sha256":"be1fcb66794dd78698f982d04ad682a5dfeba6973fac968c2321ec3f9d2a8b3c","abstract_canon_sha256":"0652cc0ac449b5ec3fd37736a61c51a726dc5100b71c61b2df4693ebeb8a0738"},"schema_version":"1.0"},"canonical_sha256":"4c9a1b89c14ea260080c2184c75904bf7d75e4fc442908e1b26bce4966f7c1ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:35.386502Z","signature_b64":"MYL37hlbAHGLgO053TabuIiPwLqetYGna3g3Pdm4ZyRIuXC5PX5wx7LozCVJBmpEORH4WQbHG9mF15IojonEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c9a1b89c14ea260080c2184c75904bf7d75e4fc442908e1b26bce4966f7c1ba","last_reissued_at":"2026-05-18T01:35:35.385911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:35.385911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.3462","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:35:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nc+5OF9lq0Gcf0Dy2q6JYFP5uVv3/UjsVsXOyNcfeoMXpS98htXiiwQP9V64JJnv5shdp+osW+JZ4Kwj1eNJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T17:19:27.976828Z"},"content_sha256":"a072ce117c9f05ed1bebba7cd4fded75febf216e6c7e97742629cfa0f58a1cc2","schema_version":"1.0","event_id":"sha256:a072ce117c9f05ed1bebba7cd4fded75febf216e6c7e97742629cfa0f58a1cc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JSNBXCOBJ2RGACAMEGCMOWIEX5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-Streaming Algorithms for Annotated Graph Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Justin Thaler","submitted_at":"2014-07-13T13:19:07Z","abstract_excerpt":"Considerable effort has been devoted to the development of streaming algorithms for analyzing massive graphs. Unfortunately, many results have been negative, establishing that a wide variety of problems require $\\Omega(n^2)$ space to solve. One of the few bright spots has been the development of semi-streaming algorithms for a handful of graph problems -- these algorithms use space $O(n\\cdot\\text{polylog}(n))$.\n  In the annotated data streaming model of Chakrabarti et al., a computationally limited client wants to compute some property of a massive input, but lacks the resources to store even "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3462","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:35:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KvNTX6jio+En84BReVgPsJ7yUlEGKlVCPrrMk/xuqrSo1xw2+jeIRrJk7RjkTwJEu68tXV1ZyEVhHNCx5dU9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T17:19:27.977405Z"},"content_sha256":"a3ab40bd11a1d2c1b95103afa6408871a8698010c2c0ce298eeb1e65d68ececb","schema_version":"1.0","event_id":"sha256:a3ab40bd11a1d2c1b95103afa6408871a8698010c2c0ce298eeb1e65d68ececb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JSNBXCOBJ2RGACAMEGCMOWIEX5/bundle.json","state_url":"https://pith.science/pith/JSNBXCOBJ2RGACAMEGCMOWIEX5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JSNBXCOBJ2RGACAMEGCMOWIEX5/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-05-20T17:19:27Z","links":{"resolver":"https://pith.science/pith/JSNBXCOBJ2RGACAMEGCMOWIEX5","bundle":"https://pith.science/pith/JSNBXCOBJ2RGACAMEGCMOWIEX5/bundle.json","state":"https://pith.science/pith/JSNBXCOBJ2RGACAMEGCMOWIEX5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JSNBXCOBJ2RGACAMEGCMOWIEX5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JSNBXCOBJ2RGACAMEGCMOWIEX5","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":"0652cc0ac449b5ec3fd37736a61c51a726dc5100b71c61b2df4693ebeb8a0738","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-13T13:19:07Z","title_canon_sha256":"be1fcb66794dd78698f982d04ad682a5dfeba6973fac968c2321ec3f9d2a8b3c"},"schema_version":"1.0","source":{"id":"1407.3462","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3462","created_at":"2026-05-18T01:35:35Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3462v2","created_at":"2026-05-18T01:35:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3462","created_at":"2026-05-18T01:35:35Z"},{"alias_kind":"pith_short_12","alias_value":"JSNBXCOBJ2RG","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JSNBXCOBJ2RGACAM","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JSNBXCOB","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:a3ab40bd11a1d2c1b95103afa6408871a8698010c2c0ce298eeb1e65d68ececb","target":"graph","created_at":"2026-05-18T01:35:35Z","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":"Considerable effort has been devoted to the development of streaming algorithms for analyzing massive graphs. Unfortunately, many results have been negative, establishing that a wide variety of problems require $\\Omega(n^2)$ space to solve. One of the few bright spots has been the development of semi-streaming algorithms for a handful of graph problems -- these algorithms use space $O(n\\cdot\\text{polylog}(n))$.\n  In the annotated data streaming model of Chakrabarti et al., a computationally limited client wants to compute some property of a massive input, but lacks the resources to store even ","authors_text":"Justin Thaler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-13T13:19:07Z","title":"Semi-Streaming Algorithms for Annotated Graph Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3462","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:a072ce117c9f05ed1bebba7cd4fded75febf216e6c7e97742629cfa0f58a1cc2","target":"record","created_at":"2026-05-18T01:35:35Z","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":"0652cc0ac449b5ec3fd37736a61c51a726dc5100b71c61b2df4693ebeb8a0738","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-13T13:19:07Z","title_canon_sha256":"be1fcb66794dd78698f982d04ad682a5dfeba6973fac968c2321ec3f9d2a8b3c"},"schema_version":"1.0","source":{"id":"1407.3462","kind":"arxiv","version":2}},"canonical_sha256":"4c9a1b89c14ea260080c2184c75904bf7d75e4fc442908e1b26bce4966f7c1ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c9a1b89c14ea260080c2184c75904bf7d75e4fc442908e1b26bce4966f7c1ba","first_computed_at":"2026-05-18T01:35:35.385911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:35.385911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MYL37hlbAHGLgO053TabuIiPwLqetYGna3g3Pdm4ZyRIuXC5PX5wx7LozCVJBmpEORH4WQbHG9mF15IojonEBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:35.386502Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.3462","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a072ce117c9f05ed1bebba7cd4fded75febf216e6c7e97742629cfa0f58a1cc2","sha256:a3ab40bd11a1d2c1b95103afa6408871a8698010c2c0ce298eeb1e65d68ececb"],"state_sha256":"58e114bfb3b22919c52fc1341edfcb9d30d620cf002c501c8100d91a326368e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uTg+fotKm3cKEBJfiREyvxVqLLIwLnXqClEpMAQDUFwQlP807HcfQdb9X5cf1MhylIvaRHKjS0F314W1l7NjDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T17:19:27.981745Z","bundle_sha256":"01389fd6911f5eb4f3d104aeae9616bbc0b3f3787413e10bac83f4a44dbaaea6"}}