{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XNCDZMQP4UJ3X7GXLXFXLQ54BS","short_pith_number":"pith:XNCDZMQP","canonical_record":{"source":{"id":"1710.04091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-11T14:35:53Z","cross_cats_sorted":[],"title_canon_sha256":"cae655174e3d229de8031e0d8e1ef3c2ccb6777635a85f3a9bfd9d23692a2570","abstract_canon_sha256":"e6fc1c2ce7a7c81f3612c44b129e43cf6d7b707cb4bb408f7aaee215492595fd"},"schema_version":"1.0"},"canonical_sha256":"bb443cb20fe513bbfcd75dcb75c3bc0cb3f8ebc1a9068ef1df59569af3f1f61c","source":{"kind":"arxiv","id":"1710.04091","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04091","created_at":"2026-05-18T00:33:05Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04091v1","created_at":"2026-05-18T00:33:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04091","created_at":"2026-05-18T00:33:05Z"},{"alias_kind":"pith_short_12","alias_value":"XNCDZMQP4UJ3","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XNCDZMQP4UJ3X7GX","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XNCDZMQP","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XNCDZMQP4UJ3X7GXLXFXLQ54BS","target":"record","payload":{"canonical_record":{"source":{"id":"1710.04091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-11T14:35:53Z","cross_cats_sorted":[],"title_canon_sha256":"cae655174e3d229de8031e0d8e1ef3c2ccb6777635a85f3a9bfd9d23692a2570","abstract_canon_sha256":"e6fc1c2ce7a7c81f3612c44b129e43cf6d7b707cb4bb408f7aaee215492595fd"},"schema_version":"1.0"},"canonical_sha256":"bb443cb20fe513bbfcd75dcb75c3bc0cb3f8ebc1a9068ef1df59569af3f1f61c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:05.072103Z","signature_b64":"PSICRs35iUQlrnc7Yf2Zf9M2/5mvNw3cPVYe6xnI1W9KRvgDpB8JWiyIrIoXg7SzKPMs5IuZregNNVFypdwkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb443cb20fe513bbfcd75dcb75c3bc0cb3f8ebc1a9068ef1df59569af3f1f61c","last_reissued_at":"2026-05-18T00:33:05.071553Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:05.071553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.04091","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:33:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fyBIee1TSp9QRkhuIsYT1sWhxZ7Lf+b0Z7Dv8DHej35T/E2sJ+pmgESxBB2LFEKW0ciBAWbF7rFcoVs9ECKNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T22:17:59.914632Z"},"content_sha256":"136d6f90dcf5111ebfdd892977f21e4a7c6d68e84269679f3a934ab47207aecc","schema_version":"1.0","event_id":"sha256:136d6f90dcf5111ebfdd892977f21e4a7c6d68e84269679f3a934ab47207aecc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XNCDZMQP4UJ3X7GXLXFXLQ54BS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anand Srivastav, Christian Glazik, Jan Schiemann","submitted_at":"2017-10-11T14:35:53Z","abstract_excerpt":"We study the problem of finding an Euler tour in an undirected graph G in the W-Streaming model with O(n polylog(n)) RAM, where n resp. m is the number of nodes resp. edges of G. Our main result is the first one pass W-Streaming algorithm computing an Euler tour of G in the form of an edge successor function with only O(n log(n)) RAM which is optimal for this setting (e.g., Sun and Woodruff (2015)). The previously best-known result in this model is implicitly given by Demetrescu et al. (2010) with the parallel algorithm of Atallah and Vishkin (1984) using O(m/n) passes under the same RAM limit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04091","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:33:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hF66EHc1ZQQTDvPUCucBkZz+YII6KhLMqz+yNyO6axjcYd/D4XOk8lSXG5XGp5Ixf0GGxc7XRD8ANcH0NrNjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T22:17:59.915082Z"},"content_sha256":"b7273c848fedeab4cac66c1561c4fb42850b59564b4bca677e1ff24b9665abd7","schema_version":"1.0","event_id":"sha256:b7273c848fedeab4cac66c1561c4fb42850b59564b4bca677e1ff24b9665abd7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XNCDZMQP4UJ3X7GXLXFXLQ54BS/bundle.json","state_url":"https://pith.science/pith/XNCDZMQP4UJ3X7GXLXFXLQ54BS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XNCDZMQP4UJ3X7GXLXFXLQ54BS/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-08-21T22:17:59Z","links":{"resolver":"https://pith.science/pith/XNCDZMQP4UJ3X7GXLXFXLQ54BS","bundle":"https://pith.science/pith/XNCDZMQP4UJ3X7GXLXFXLQ54BS/bundle.json","state":"https://pith.science/pith/XNCDZMQP4UJ3X7GXLXFXLQ54BS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XNCDZMQP4UJ3X7GXLXFXLQ54BS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XNCDZMQP4UJ3X7GXLXFXLQ54BS","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":"e6fc1c2ce7a7c81f3612c44b129e43cf6d7b707cb4bb408f7aaee215492595fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-11T14:35:53Z","title_canon_sha256":"cae655174e3d229de8031e0d8e1ef3c2ccb6777635a85f3a9bfd9d23692a2570"},"schema_version":"1.0","source":{"id":"1710.04091","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04091","created_at":"2026-05-18T00:33:05Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04091v1","created_at":"2026-05-18T00:33:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04091","created_at":"2026-05-18T00:33:05Z"},{"alias_kind":"pith_short_12","alias_value":"XNCDZMQP4UJ3","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XNCDZMQP4UJ3X7GX","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XNCDZMQP","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:b7273c848fedeab4cac66c1561c4fb42850b59564b4bca677e1ff24b9665abd7","target":"graph","created_at":"2026-05-18T00:33:05Z","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 study the problem of finding an Euler tour in an undirected graph G in the W-Streaming model with O(n polylog(n)) RAM, where n resp. m is the number of nodes resp. edges of G. Our main result is the first one pass W-Streaming algorithm computing an Euler tour of G in the form of an edge successor function with only O(n log(n)) RAM which is optimal for this setting (e.g., Sun and Woodruff (2015)). The previously best-known result in this model is implicitly given by Demetrescu et al. (2010) with the parallel algorithm of Atallah and Vishkin (1984) using O(m/n) passes under the same RAM limit","authors_text":"Anand Srivastav, Christian Glazik, Jan Schiemann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-11T14:35:53Z","title":"Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04091","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:136d6f90dcf5111ebfdd892977f21e4a7c6d68e84269679f3a934ab47207aecc","target":"record","created_at":"2026-05-18T00:33:05Z","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":"e6fc1c2ce7a7c81f3612c44b129e43cf6d7b707cb4bb408f7aaee215492595fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-11T14:35:53Z","title_canon_sha256":"cae655174e3d229de8031e0d8e1ef3c2ccb6777635a85f3a9bfd9d23692a2570"},"schema_version":"1.0","source":{"id":"1710.04091","kind":"arxiv","version":1}},"canonical_sha256":"bb443cb20fe513bbfcd75dcb75c3bc0cb3f8ebc1a9068ef1df59569af3f1f61c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb443cb20fe513bbfcd75dcb75c3bc0cb3f8ebc1a9068ef1df59569af3f1f61c","first_computed_at":"2026-05-18T00:33:05.071553Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:05.071553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PSICRs35iUQlrnc7Yf2Zf9M2/5mvNw3cPVYe6xnI1W9KRvgDpB8JWiyIrIoXg7SzKPMs5IuZregNNVFypdwkDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:05.072103Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.04091","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:136d6f90dcf5111ebfdd892977f21e4a7c6d68e84269679f3a934ab47207aecc","sha256:b7273c848fedeab4cac66c1561c4fb42850b59564b4bca677e1ff24b9665abd7"],"state_sha256":"09db7911dee55cadb0b8501e672021e7a5a1f3ec117b6beea992d9208be0b993"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Wj6RAT9jFghYeegOG65VrAdHsW/9K+EUvbD/Jjegzx2d+dBSl0x7syvMbCXolcevZSe7/9aETdvWbMs05EaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T22:17:59.919023Z","bundle_sha256":"7eb28bac178563d2695388659c02360b555e07d5ec85e028f025264dee81c396"}}