{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OJEDB2BQMUT7O65WCNAH7UUFLT","short_pith_number":"pith:OJEDB2BQ","schema_version":"1.0","canonical_sha256":"724830e8306527f77bb613407fd2855cd095b1745d79a6bf477926c6106d690e","source":{"kind":"arxiv","id":"1610.03412","version":1},"attestation_state":"computed","paper":{"title":"Finding Euler Tours in the StrSort Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anand Srivastav, Jan Schiemann, Lasse Kliemann","submitted_at":"2016-10-11T16:16:05Z","abstract_excerpt":"We present a first algorithm for finding Euler tours in undirected graphs in the StrSort model. This model is a relaxation of the semi streaming model. The graph is given as a stream of its edges and can only be read sequentially, but while doing a pass over the stream we are allowed to write out another stream which will be the input for the next pass. In addition, items in the stream are sorted between passes. This model was introduced by Aggarwal et al. in 2004. Here we apply this model to the problem of finding an Euler tour in a graph (or to decide that the graph does not admit an Euler t"},"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":"1610.03412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-11T16:16:05Z","cross_cats_sorted":[],"title_canon_sha256":"bc3ba7adc91e29afd469b080122ba379fe0a65206de44dc1d501fbef2f4ff7ed","abstract_canon_sha256":"bd27f8c620aee1ce2f81ff200e09317421f0ad9f3bbf9bdb506f31645e708282"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:31.560431Z","signature_b64":"2uCscg6nZIbVkEL0RorhWsolvFw/CSoBADhypv3e1WOGDx4BBJBLRr7tIQWfPe10SEbReZrF3WIuPbTgxyNIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"724830e8306527f77bb613407fd2855cd095b1745d79a6bf477926c6106d690e","last_reissued_at":"2026-05-18T01:02:31.559801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:31.559801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Euler Tours in the StrSort Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anand Srivastav, Jan Schiemann, Lasse Kliemann","submitted_at":"2016-10-11T16:16:05Z","abstract_excerpt":"We present a first algorithm for finding Euler tours in undirected graphs in the StrSort model. This model is a relaxation of the semi streaming model. The graph is given as a stream of its edges and can only be read sequentially, but while doing a pass over the stream we are allowed to write out another stream which will be the input for the next pass. In addition, items in the stream are sorted between passes. This model was introduced by Aggarwal et al. in 2004. Here we apply this model to the problem of finding an Euler tour in a graph (or to decide that the graph does not admit an Euler t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03412","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":"1610.03412","created_at":"2026-05-18T01:02:31.559922+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.03412v1","created_at":"2026-05-18T01:02:31.559922+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03412","created_at":"2026-05-18T01:02:31.559922+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJEDB2BQMUT7","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJEDB2BQMUT7O65W","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJEDB2BQ","created_at":"2026-05-18T12:30:36.002864+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OJEDB2BQMUT7O65WCNAH7UUFLT","json":"https://pith.science/pith/OJEDB2BQMUT7O65WCNAH7UUFLT.json","graph_json":"https://pith.science/api/pith-number/OJEDB2BQMUT7O65WCNAH7UUFLT/graph.json","events_json":"https://pith.science/api/pith-number/OJEDB2BQMUT7O65WCNAH7UUFLT/events.json","paper":"https://pith.science/paper/OJEDB2BQ"},"agent_actions":{"view_html":"https://pith.science/pith/OJEDB2BQMUT7O65WCNAH7UUFLT","download_json":"https://pith.science/pith/OJEDB2BQMUT7O65WCNAH7UUFLT.json","view_paper":"https://pith.science/paper/OJEDB2BQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.03412&json=true","fetch_graph":"https://pith.science/api/pith-number/OJEDB2BQMUT7O65WCNAH7UUFLT/graph.json","fetch_events":"https://pith.science/api/pith-number/OJEDB2BQMUT7O65WCNAH7UUFLT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJEDB2BQMUT7O65WCNAH7UUFLT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJEDB2BQMUT7O65WCNAH7UUFLT/action/storage_attestation","attest_author":"https://pith.science/pith/OJEDB2BQMUT7O65WCNAH7UUFLT/action/author_attestation","sign_citation":"https://pith.science/pith/OJEDB2BQMUT7O65WCNAH7UUFLT/action/citation_signature","submit_replication":"https://pith.science/pith/OJEDB2BQMUT7O65WCNAH7UUFLT/action/replication_record"}},"created_at":"2026-05-18T01:02:31.559922+00:00","updated_at":"2026-05-18T01:02:31.559922+00:00"}