{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FHYIWAQMFG23PYJGQIDWA3I4F5","short_pith_number":"pith:FHYIWAQM","canonical_record":{"source":{"id":"1711.04881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-13T22:50:09Z","cross_cats_sorted":[],"title_canon_sha256":"c23af78af15328184883ab170cdfd5c4784210d3dabd57ab5de6a3c7276f9236","abstract_canon_sha256":"b326719f98d3b77090356dfb69f2a4481acb889f12ab1c6594a1ff89bc0529c7"},"schema_version":"1.0"},"canonical_sha256":"29f08b020c29b5b7e1268207606d1c2f67ac81a7176496a7c256cb2642d69324","source":{"kind":"arxiv","id":"1711.04881","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04881","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04881v1","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04881","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"pith_short_12","alias_value":"FHYIWAQMFG23","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FHYIWAQMFG23PYJG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FHYIWAQM","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FHYIWAQMFG23PYJGQIDWA3I4F5","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-13T22:50:09Z","cross_cats_sorted":[],"title_canon_sha256":"c23af78af15328184883ab170cdfd5c4784210d3dabd57ab5de6a3c7276f9236","abstract_canon_sha256":"b326719f98d3b77090356dfb69f2a4481acb889f12ab1c6594a1ff89bc0529c7"},"schema_version":"1.0"},"canonical_sha256":"29f08b020c29b5b7e1268207606d1c2f67ac81a7176496a7c256cb2642d69324","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:35.510168Z","signature_b64":"ZfIi9OBvTUz2SyyF+05z9HZI/qynlGzQ6ALDdnddEpzRSffLZlCfPRzt9PcZuOZ7/t/y+/OoWRpnQA8jDABzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29f08b020c29b5b7e1268207606d1c2f67ac81a7176496a7c256cb2642d69324","last_reissued_at":"2026-05-18T00:30:35.509563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:35.509563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04881","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-18T00:30:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Of8T+IrRjjESS6g0xzESK71i90UZieyZp/pC5YwAIq2XyVGHgvfUvUQm/FrU+lUTtCFs++FQC/KOFQoaAvfoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:55:34.057530Z"},"content_sha256":"31401d2b1bd202eb08c45d9a13a4ffa77168738dac93072e5a661fa677aec1c6","schema_version":"1.0","event_id":"sha256:31401d2b1bd202eb08c45d9a13a4ffa77168738dac93072e5a661fa677aec1c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FHYIWAQMFG23PYJGQIDWA3I4F5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Estimating Graph Parameters from Random Order Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Sohler, Pan Peng","submitted_at":"2017-11-13T22:50:09Z","abstract_excerpt":"We develop a new algorithmic technique that allows to transfer some constant time approximation algorithms for general graphs into random order streaming algorithms. We illustrate our technique by proving that in random order streams with probability at least $2/3$,\n  $\\bullet$ the number of connected components of $G$ can be approximated up to an additive error of $\\varepsilon n$ using $(\\frac{1}{\\varepsilon})^{O(1/\\varepsilon^3)}$ space,\n  $\\bullet$ the weight of a minimum spanning tree of a connected input graph with integer edges weights from $\\{1,\\dots,W\\}$ can be approximated within a mu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04881","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-18T00:30:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9bVK5Uc1rIjxj/0qod/eY1J6Vl1TCkTwIPkPNtLErUgMmJhz52O7Ki/qq4dHXnCortb+rrJb85qjMAvfDyF5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:55:34.057881Z"},"content_sha256":"ad300d175bcda359b1c6bbbd906f1775711469c0cd314678461b63092aebf7b7","schema_version":"1.0","event_id":"sha256:ad300d175bcda359b1c6bbbd906f1775711469c0cd314678461b63092aebf7b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FHYIWAQMFG23PYJGQIDWA3I4F5/bundle.json","state_url":"https://pith.science/pith/FHYIWAQMFG23PYJGQIDWA3I4F5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FHYIWAQMFG23PYJGQIDWA3I4F5/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-26T21:55:34Z","links":{"resolver":"https://pith.science/pith/FHYIWAQMFG23PYJGQIDWA3I4F5","bundle":"https://pith.science/pith/FHYIWAQMFG23PYJGQIDWA3I4F5/bundle.json","state":"https://pith.science/pith/FHYIWAQMFG23PYJGQIDWA3I4F5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FHYIWAQMFG23PYJGQIDWA3I4F5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FHYIWAQMFG23PYJGQIDWA3I4F5","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":"b326719f98d3b77090356dfb69f2a4481acb889f12ab1c6594a1ff89bc0529c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-13T22:50:09Z","title_canon_sha256":"c23af78af15328184883ab170cdfd5c4784210d3dabd57ab5de6a3c7276f9236"},"schema_version":"1.0","source":{"id":"1711.04881","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04881","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04881v1","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04881","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"pith_short_12","alias_value":"FHYIWAQMFG23","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FHYIWAQMFG23PYJG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FHYIWAQM","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:ad300d175bcda359b1c6bbbd906f1775711469c0cd314678461b63092aebf7b7","target":"graph","created_at":"2026-05-18T00:30: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":"We develop a new algorithmic technique that allows to transfer some constant time approximation algorithms for general graphs into random order streaming algorithms. We illustrate our technique by proving that in random order streams with probability at least $2/3$,\n  $\\bullet$ the number of connected components of $G$ can be approximated up to an additive error of $\\varepsilon n$ using $(\\frac{1}{\\varepsilon})^{O(1/\\varepsilon^3)}$ space,\n  $\\bullet$ the weight of a minimum spanning tree of a connected input graph with integer edges weights from $\\{1,\\dots,W\\}$ can be approximated within a mu","authors_text":"Christian Sohler, Pan Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-13T22:50:09Z","title":"Estimating Graph Parameters from Random Order Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04881","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:31401d2b1bd202eb08c45d9a13a4ffa77168738dac93072e5a661fa677aec1c6","target":"record","created_at":"2026-05-18T00:30: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":"b326719f98d3b77090356dfb69f2a4481acb889f12ab1c6594a1ff89bc0529c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-13T22:50:09Z","title_canon_sha256":"c23af78af15328184883ab170cdfd5c4784210d3dabd57ab5de6a3c7276f9236"},"schema_version":"1.0","source":{"id":"1711.04881","kind":"arxiv","version":1}},"canonical_sha256":"29f08b020c29b5b7e1268207606d1c2f67ac81a7176496a7c256cb2642d69324","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29f08b020c29b5b7e1268207606d1c2f67ac81a7176496a7c256cb2642d69324","first_computed_at":"2026-05-18T00:30:35.509563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:35.509563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZfIi9OBvTUz2SyyF+05z9HZI/qynlGzQ6ALDdnddEpzRSffLZlCfPRzt9PcZuOZ7/t/y+/OoWRpnQA8jDABzBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:35.510168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04881","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31401d2b1bd202eb08c45d9a13a4ffa77168738dac93072e5a661fa677aec1c6","sha256:ad300d175bcda359b1c6bbbd906f1775711469c0cd314678461b63092aebf7b7"],"state_sha256":"495ac1efcb1a12a236c94886fba00ca589242a7f809c924d988c82f1289e34b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Pj/H/cgYqhaYo2fYwz8AtYj4md17EjHKLsjYUXWggIfQlBsV6aGaBIl0ForTzpxI2gmZivPqqQXwQScgSGpCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:55:34.060194Z","bundle_sha256":"3c1cec81e3bb82b38b0a5675c0d43c74893961286f3774a2a9cfbd04484267a9"}}