{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WWVHA7HTCC4NN4MDYF6UYCQYBI","short_pith_number":"pith:WWVHA7HT","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"},"canonical_sha256":"b5aa707cf310b8d6f183c17d4c0a180a0812a9c3f665636a16fc99cabde8dda9","source":{"kind":"arxiv","id":"1101.4283","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4283","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4283v2","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4283","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"WWVHA7HTCC4N","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WWVHA7HTCC4NN4MD","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WWVHA7HT","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WWVHA7HTCC4NN4MDYF6UYCQYBI","target":"record","payload":{"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"},"canonical_sha256":"b5aa707cf310b8d6f183c17d4c0a180a0812a9c3f665636a16fc99cabde8dda9","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"},"source_kind":"arxiv","source_id":"1101.4283","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xt50XoLkO+HZkPQGscEFP+4saedyKSQd78RpX8nHyAqX0SNfq90hKRJG+ZRSyrMW74nkTrnt6NjlNrF9bWHJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:42:55.415643Z"},"content_sha256":"53515262724702328ed5319d12e40cd260a4befd1577a2b6d80f11ab2dd6af50","schema_version":"1.0","event_id":"sha256:53515262724702328ed5319d12e40cd260a4befd1577a2b6d80f11ab2dd6af50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WWVHA7HTCC4NN4MDYF6UYCQYBI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I52nvE2ZxIVp8d80cS8VSBX6foIp9/9zMZ6BeX1wyzr4nSAdIiTrL+nTDjlqnLG0oEE7yg5FdAu1piYepPrtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:42:55.416049Z"},"content_sha256":"279d98495d8c697db3a81e8ea6bfc2caf2abfa482bcbdd469ed9f5ce99aefa06","schema_version":"1.0","event_id":"sha256:279d98495d8c697db3a81e8ea6bfc2caf2abfa482bcbdd469ed9f5ce99aefa06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WWVHA7HTCC4NN4MDYF6UYCQYBI/bundle.json","state_url":"https://pith.science/pith/WWVHA7HTCC4NN4MDYF6UYCQYBI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WWVHA7HTCC4NN4MDYF6UYCQYBI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T12:42:55Z","links":{"resolver":"https://pith.science/pith/WWVHA7HTCC4NN4MDYF6UYCQYBI","bundle":"https://pith.science/pith/WWVHA7HTCC4NN4MDYF6UYCQYBI/bundle.json","state":"https://pith.science/pith/WWVHA7HTCC4NN4MDYF6UYCQYBI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WWVHA7HTCC4NN4MDYF6UYCQYBI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WWVHA7HTCC4NN4MDYF6UYCQYBI","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":"91f2888c024b983d623e4c8190886f98d744a9750c54217de7e3d6a7948180d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-22T12:44:33Z","title_canon_sha256":"a40833ae3c36fe4c176c0c610345d83937ad06d9fb9975c1608464a3b17de52f"},"schema_version":"1.0","source":{"id":"1101.4283","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4283","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4283v2","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4283","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"WWVHA7HTCC4N","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WWVHA7HTCC4NN4MD","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WWVHA7HT","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:279d98495d8c697db3a81e8ea6bfc2caf2abfa482bcbdd469ed9f5ce99aefa06","target":"graph","created_at":"2026-05-18T02:22:50Z","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":"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","authors_text":"Manuel Sorge","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-22T12:44:33Z","title":"On Making Directed Graphs Eulerian"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4283","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:53515262724702328ed5319d12e40cd260a4befd1577a2b6d80f11ab2dd6af50","target":"record","created_at":"2026-05-18T02:22:50Z","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":"91f2888c024b983d623e4c8190886f98d744a9750c54217de7e3d6a7948180d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-22T12:44:33Z","title_canon_sha256":"a40833ae3c36fe4c176c0c610345d83937ad06d9fb9975c1608464a3b17de52f"},"schema_version":"1.0","source":{"id":"1101.4283","kind":"arxiv","version":2}},"canonical_sha256":"b5aa707cf310b8d6f183c17d4c0a180a0812a9c3f665636a16fc99cabde8dda9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5aa707cf310b8d6f183c17d4c0a180a0812a9c3f665636a16fc99cabde8dda9","first_computed_at":"2026-05-18T02:22:50.508627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:50.508627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t2qDeNcc2AQ2n9uGm4qwPECXfbq8DdZ7TFGog3a++zL8Kxu2KD7YaiFF4U2op+dg4Z5heWBtQYZ/LIKWNU5PDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:50.509338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.4283","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53515262724702328ed5319d12e40cd260a4befd1577a2b6d80f11ab2dd6af50","sha256:279d98495d8c697db3a81e8ea6bfc2caf2abfa482bcbdd469ed9f5ce99aefa06"],"state_sha256":"3bf12d61546c2431870d2f454e227f6968666345849bee0f4ce729e0184594a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KM3Lgpp8I1YUvwcV9L8+x+khgwkM9fTZgW2IvjBiZZuPxYVdtm6Pia+mp9KUQwtE2o7YU1iM2zw8yOMORG5pCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T12:42:55.419392Z","bundle_sha256":"75c475a058ce2e9be782653b245acbd458186e35b214836d8650a5ad13e70f67"}}