{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QP7OS3TDOZGYSBEEAL5RRFTTJ3","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":"003c85061ad55ea22d2e0d875e2fb4c6881b0aa016ae43bfd9c3848b364e2b1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-25T02:04:23Z","title_canon_sha256":"fd37769d9e07f174d41ac9aa0b0032917de3397358f5ad2335f9d30a7f52bc64"},"schema_version":"1.0","source":{"id":"1710.09048","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09048","created_at":"2026-05-17T23:54:03Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09048v2","created_at":"2026-05-17T23:54:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09048","created_at":"2026-05-17T23:54:03Z"},{"alias_kind":"pith_short_12","alias_value":"QP7OS3TDOZGY","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QP7OS3TDOZGYSBEE","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QP7OS3TD","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:93ca6168b43d899ed0ea5f6eed429453065d370b1c9de9ca24a208c3c9e1a15e","target":"graph","created_at":"2026-05-17T23:54:03Z","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":"In 2009, Jonoska, Seeman and Wu showed that every graph admits a route for a DNA reporter strand, that is, a closed walk covering every edge either once or twice, in opposite directions if twice, and passing through each vertex in a particular way. This corresponds to showing that every graph has an \\emph{edge-outer embedding}, that is, an orientable embedding with some face that is incident with every edge. In the motivating application, the objective is such a closed walk of minimum length. Here we give a short algorithmic proof of the original existence result, and also prove that finding a","authors_text":"Joanna A. Ellis-Monaghan, M. N. Ellingham","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-25T02:04:23Z","title":"Edge-outer graph embedding and the complexity of the DNA reporter strand problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09048","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:266330b98d70da7f0b4e9378c3ab270c50269a61475cdd45e93c490cbb930bef","target":"record","created_at":"2026-05-17T23:54:03Z","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":"003c85061ad55ea22d2e0d875e2fb4c6881b0aa016ae43bfd9c3848b364e2b1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-25T02:04:23Z","title_canon_sha256":"fd37769d9e07f174d41ac9aa0b0032917de3397358f5ad2335f9d30a7f52bc64"},"schema_version":"1.0","source":{"id":"1710.09048","kind":"arxiv","version":2}},"canonical_sha256":"83fee96e63764d89048402fb1896734efaee8f995d370d267c9f9da34f3b7604","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83fee96e63764d89048402fb1896734efaee8f995d370d267c9f9da34f3b7604","first_computed_at":"2026-05-17T23:54:03.187774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:03.187774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K2958rUaLF3kvUP//LsiXYqqIVc7dgHTmn4IgA9Rn3DOUa6mYqaE3VGWJWhKC/euxBhLFBVnpAeWf1xCTNFyBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:03.188194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.09048","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:266330b98d70da7f0b4e9378c3ab270c50269a61475cdd45e93c490cbb930bef","sha256:93ca6168b43d899ed0ea5f6eed429453065d370b1c9de9ca24a208c3c9e1a15e"],"state_sha256":"c221d598cfdbbd7f2d531b3084941f61fe4098b62f4e8fa161a90572845a40a9"}