{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WWVHA7HTCC4NN4MDYF6UYCQYBI","short_pith_number":"pith:WWVHA7HT","schema_version":"1.0","canonical_sha256":"b5aa707cf310b8d6f183c17d4c0a180a0812a9c3f665636a16fc99cabde8dda9","source":{"kind":"arxiv","id":"1101.4283","version":2},"attestation_state":"computed","paper":{"title":"On Making Directed Graphs Eulerian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Manuel Sorge","submitted_at":"2011-01-22T12:44:33Z","abstract_excerpt":"A directed graph is called Eulerian, if it contains a tour that traverses every arc in the graph exactly once. We study the problem of Eulerian extension (EE) where a directed multigraph G and a weight function is given and it is asked whether G can be made Eulerian by adding arcs whose total weight does not exceed a given threshold. This problem is motivated through applications in vehicle routing and flowshop scheduling. However, EE is NP-hard and thus we use the parameterized complexity framework to analyze it. In parameterized complexity, the running time of algorithms is considered not on"},"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":"1101.4283","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-22T12:44:33Z","cross_cats_sorted":[],"title_canon_sha256":"a40833ae3c36fe4c176c0c610345d83937ad06d9fb9975c1608464a3b17de52f","abstract_canon_sha256":"91f2888c024b983d623e4c8190886f98d744a9750c54217de7e3d6a7948180d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:50.509338Z","signature_b64":"t2qDeNcc2AQ2n9uGm4qwPECXfbq8DdZ7TFGog3a++zL8Kxu2KD7YaiFF4U2op+dg4Z5heWBtQYZ/LIKWNU5PDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5aa707cf310b8d6f183c17d4c0a180a0812a9c3f665636a16fc99cabde8dda9","last_reissued_at":"2026-05-18T02:22:50.508627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:50.508627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Making Directed Graphs Eulerian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Manuel Sorge","submitted_at":"2011-01-22T12:44:33Z","abstract_excerpt":"A directed graph is called Eulerian, if it contains a tour that traverses every arc in the graph exactly once. We study the problem of Eulerian extension (EE) where a directed multigraph G and a weight function is given and it is asked whether G can be made Eulerian by adding arcs whose total weight does not exceed a given threshold. This problem is motivated through applications in vehicle routing and flowshop scheduling. However, EE is NP-hard and thus we use the parameterized complexity framework to analyze it. In parameterized complexity, the running time of algorithms is considered not on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4283","kind":"arxiv","version":2},"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":"1101.4283","created_at":"2026-05-18T02:22:50.508728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.4283v2","created_at":"2026-05-18T02:22:50.508728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4283","created_at":"2026-05-18T02:22:50.508728+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWVHA7HTCC4N","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWVHA7HTCC4NN4MD","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWVHA7HT","created_at":"2026-05-18T12:26:44.992195+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/WWVHA7HTCC4NN4MDYF6UYCQYBI","json":"https://pith.science/pith/WWVHA7HTCC4NN4MDYF6UYCQYBI.json","graph_json":"https://pith.science/api/pith-number/WWVHA7HTCC4NN4MDYF6UYCQYBI/graph.json","events_json":"https://pith.science/api/pith-number/WWVHA7HTCC4NN4MDYF6UYCQYBI/events.json","paper":"https://pith.science/paper/WWVHA7HT"},"agent_actions":{"view_html":"https://pith.science/pith/WWVHA7HTCC4NN4MDYF6UYCQYBI","download_json":"https://pith.science/pith/WWVHA7HTCC4NN4MDYF6UYCQYBI.json","view_paper":"https://pith.science/paper/WWVHA7HT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.4283&json=true","fetch_graph":"https://pith.science/api/pith-number/WWVHA7HTCC4NN4MDYF6UYCQYBI/graph.json","fetch_events":"https://pith.science/api/pith-number/WWVHA7HTCC4NN4MDYF6UYCQYBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWVHA7HTCC4NN4MDYF6UYCQYBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWVHA7HTCC4NN4MDYF6UYCQYBI/action/storage_attestation","attest_author":"https://pith.science/pith/WWVHA7HTCC4NN4MDYF6UYCQYBI/action/author_attestation","sign_citation":"https://pith.science/pith/WWVHA7HTCC4NN4MDYF6UYCQYBI/action/citation_signature","submit_replication":"https://pith.science/pith/WWVHA7HTCC4NN4MDYF6UYCQYBI/action/replication_record"}},"created_at":"2026-05-18T02:22:50.508728+00:00","updated_at":"2026-05-18T02:22:50.508728+00:00"}