{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:H5CRRAYD637GKQW2C472MXF7SK","short_pith_number":"pith:H5CRRAYD","schema_version":"1.0","canonical_sha256":"3f45188303f6fe6542da173fa65cbf92b3597d06ef66375d002d09f527aeba54","source":{"kind":"arxiv","id":"1708.07389","version":1},"attestation_state":"computed","paper":{"title":"One-Way Trail Orientations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Anders Aamand, Eva Rotenberg, Jacob Holm, Niklas Hjuler","submitted_at":"2017-08-24T13:18:54Z","abstract_excerpt":"Given a graph, does there exist an orientation of the edges such that the resulting directed graph is strongly connected?\n  Robbins' theorem [Robbins, Am. Math. Monthly, 1939] states that such an orientation exists if and only if the graph is $2$-edge connected. A natural extension of this problem is the following: Suppose that the edges of the graph is partitioned into trails. Can we orient the trails such that the resulting directed graph is strongly connected?\n  We show that $2$-edge connectivity is again a sufficient condition and we provide a linear time algorithm for finding such an orie"},"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":"1708.07389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-24T13:18:54Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6180708dbf7a7c9d009de0b046ba6325004048d7394f0f7abbbda1c411cc8e91","abstract_canon_sha256":"c4b0edffbef6826212c41bbd4214fb083405b0a6d30a25a09abf9558ca0bcea9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:44.466839Z","signature_b64":"Zz0QRcV42dgnqIEqGSyHHxPiegLlu5b89J0xWN2YVy8DHdsCBStF+4PMbbF8lKSgkiwSik5c4B/fh3fT6G7SAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f45188303f6fe6542da173fa65cbf92b3597d06ef66375d002d09f527aeba54","last_reissued_at":"2026-05-18T00:36:44.466112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:44.466112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One-Way Trail Orientations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Anders Aamand, Eva Rotenberg, Jacob Holm, Niklas Hjuler","submitted_at":"2017-08-24T13:18:54Z","abstract_excerpt":"Given a graph, does there exist an orientation of the edges such that the resulting directed graph is strongly connected?\n  Robbins' theorem [Robbins, Am. Math. Monthly, 1939] states that such an orientation exists if and only if the graph is $2$-edge connected. A natural extension of this problem is the following: Suppose that the edges of the graph is partitioned into trails. Can we orient the trails such that the resulting directed graph is strongly connected?\n  We show that $2$-edge connectivity is again a sufficient condition and we provide a linear time algorithm for finding such an orie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07389","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":"1708.07389","created_at":"2026-05-18T00:36:44.466243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07389v1","created_at":"2026-05-18T00:36:44.466243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07389","created_at":"2026-05-18T00:36:44.466243+00:00"},{"alias_kind":"pith_short_12","alias_value":"H5CRRAYD637G","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"H5CRRAYD637GKQW2","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"H5CRRAYD","created_at":"2026-05-18T12:31:18.294218+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/H5CRRAYD637GKQW2C472MXF7SK","json":"https://pith.science/pith/H5CRRAYD637GKQW2C472MXF7SK.json","graph_json":"https://pith.science/api/pith-number/H5CRRAYD637GKQW2C472MXF7SK/graph.json","events_json":"https://pith.science/api/pith-number/H5CRRAYD637GKQW2C472MXF7SK/events.json","paper":"https://pith.science/paper/H5CRRAYD"},"agent_actions":{"view_html":"https://pith.science/pith/H5CRRAYD637GKQW2C472MXF7SK","download_json":"https://pith.science/pith/H5CRRAYD637GKQW2C472MXF7SK.json","view_paper":"https://pith.science/paper/H5CRRAYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07389&json=true","fetch_graph":"https://pith.science/api/pith-number/H5CRRAYD637GKQW2C472MXF7SK/graph.json","fetch_events":"https://pith.science/api/pith-number/H5CRRAYD637GKQW2C472MXF7SK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H5CRRAYD637GKQW2C472MXF7SK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H5CRRAYD637GKQW2C472MXF7SK/action/storage_attestation","attest_author":"https://pith.science/pith/H5CRRAYD637GKQW2C472MXF7SK/action/author_attestation","sign_citation":"https://pith.science/pith/H5CRRAYD637GKQW2C472MXF7SK/action/citation_signature","submit_replication":"https://pith.science/pith/H5CRRAYD637GKQW2C472MXF7SK/action/replication_record"}},"created_at":"2026-05-18T00:36:44.466243+00:00","updated_at":"2026-05-18T00:36:44.466243+00:00"}