{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XNCDZMQP4UJ3X7GXLXFXLQ54BS","short_pith_number":"pith:XNCDZMQP","schema_version":"1.0","canonical_sha256":"bb443cb20fe513bbfcd75dcb75c3bc0cb3f8ebc1a9068ef1df59569af3f1f61c","source":{"kind":"arxiv","id":"1710.04091","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.04091","created_at":"2026-05-18T00:33:05.071630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.04091v1","created_at":"2026-05-18T00:33:05.071630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04091","created_at":"2026-05-18T00:33:05.071630+00:00"},{"alias_kind":"pith_short_12","alias_value":"XNCDZMQP4UJ3","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XNCDZMQP4UJ3X7GX","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XNCDZMQP","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.16470","citing_title":"Improved Streaming Edge Coloring","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XNCDZMQP4UJ3X7GXLXFXLQ54BS","json":"https://pith.science/pith/XNCDZMQP4UJ3X7GXLXFXLQ54BS.json","graph_json":"https://pith.science/api/pith-number/XNCDZMQP4UJ3X7GXLXFXLQ54BS/graph.json","events_json":"https://pith.science/api/pith-number/XNCDZMQP4UJ3X7GXLXFXLQ54BS/events.json","paper":"https://pith.science/paper/XNCDZMQP"},"agent_actions":{"view_html":"https://pith.science/pith/XNCDZMQP4UJ3X7GXLXFXLQ54BS","download_json":"https://pith.science/pith/XNCDZMQP4UJ3X7GXLXFXLQ54BS.json","view_paper":"https://pith.science/paper/XNCDZMQP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.04091&json=true","fetch_graph":"https://pith.science/api/pith-number/XNCDZMQP4UJ3X7GXLXFXLQ54BS/graph.json","fetch_events":"https://pith.science/api/pith-number/XNCDZMQP4UJ3X7GXLXFXLQ54BS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XNCDZMQP4UJ3X7GXLXFXLQ54BS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XNCDZMQP4UJ3X7GXLXFXLQ54BS/action/storage_attestation","attest_author":"https://pith.science/pith/XNCDZMQP4UJ3X7GXLXFXLQ54BS/action/author_attestation","sign_citation":"https://pith.science/pith/XNCDZMQP4UJ3X7GXLXFXLQ54BS/action/citation_signature","submit_replication":"https://pith.science/pith/XNCDZMQP4UJ3X7GXLXFXLQ54BS/action/replication_record"}},"created_at":"2026-05-18T00:33:05.071630+00:00","updated_at":"2026-05-18T00:33:05.071630+00:00"}