{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BJGDB2TGZWWCMPDI2O4AMXEJL4","short_pith_number":"pith:BJGDB2TG","canonical_record":{"source":{"id":"1408.1431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-06T21:37:56Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c07cb25114a4df7d14b920063ac82b6e93d970f55645eb4f878049aef859a451","abstract_canon_sha256":"857025e8c3fb61ee3f1a51111b753cfda4c5b5f1da33e6f6ad9f7380b2c9b11e"},"schema_version":"1.0"},"canonical_sha256":"0a4c30ea66cdac263c68d3b8065c895f1eb4c65cc6cf54c75d4f238f478e782e","source":{"kind":"arxiv","id":"1408.1431","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1431","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1431v1","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1431","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"pith_short_12","alias_value":"BJGDB2TGZWWC","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BJGDB2TGZWWCMPDI","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BJGDB2TG","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BJGDB2TGZWWCMPDI2O4AMXEJL4","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-06T21:37:56Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c07cb25114a4df7d14b920063ac82b6e93d970f55645eb4f878049aef859a451","abstract_canon_sha256":"857025e8c3fb61ee3f1a51111b753cfda4c5b5f1da33e6f6ad9f7380b2c9b11e"},"schema_version":"1.0"},"canonical_sha256":"0a4c30ea66cdac263c68d3b8065c895f1eb4c65cc6cf54c75d4f238f478e782e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:40.548509Z","signature_b64":"V+0mYYM+nzcUjCziqG1Qmaoysb+G2FxUKuKph7LTec6bjSOUUclYj8stuOhmQ50NGo2usyc4Ua9iwVovy90bCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a4c30ea66cdac263c68d3b8065c895f1eb4c65cc6cf54c75d4f238f478e782e","last_reissued_at":"2026-05-18T02:45:40.547808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:40.547808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1431","source_version":1,"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:45:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uVqFTJZf9nYSBtFHNoaheUM43DmyU6026lzkd8+SnnyDtd4VlhDMjYNNNS6mmOIpqIkMWKy2MrePWcUXBNmuDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:04:12.748911Z"},"content_sha256":"d71ba95f23e277933c641b145c5a565c21b20559f4ba1ca0046283c79f957ee8","schema_version":"1.0","event_id":"sha256:d71ba95f23e277933c641b145c5a565c21b20559f4ba1ca0046283c79f957ee8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BJGDB2TGZWWCMPDI2O4AMXEJL4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum ATSP with Weights Zero and One via Half-Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Katarzyna Paluch","submitted_at":"2014-08-06T21:37:56Z","abstract_excerpt":"We present a fast combinatorial $3/4$-approximation algorithm for the maximum asymmetric TSP with weights zero and one. The approximation factor of this algorithm matches the currently best one given by Bl\\\"aser in 2004 and based on linear programming. Our algorithm first computes a maximum size matching and a maximum weight cycle cover without certain cycles of length two but possibly with {\\em half-edges} - a half-edge of a given edge $e$ is informally speaking a half of $e$ that contains one of the endpoints of $e$. Then from the computed matching and cycle cover it extracts a set of paths,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1431","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"},"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:45:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tD+pqhPdkuVlGIwyxCyvVNoQ24DCCX62ZJnmTmk8CeHkMdbc+QFhuuftTcPBINJcTDcsx/+srzLu44A1lOh6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:04:12.749239Z"},"content_sha256":"ee445f4a598d6b46d0b216b6b4e5585d56915ce52f8cc88cca8aeb12123f74e1","schema_version":"1.0","event_id":"sha256:ee445f4a598d6b46d0b216b6b4e5585d56915ce52f8cc88cca8aeb12123f74e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BJGDB2TGZWWCMPDI2O4AMXEJL4/bundle.json","state_url":"https://pith.science/pith/BJGDB2TGZWWCMPDI2O4AMXEJL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BJGDB2TGZWWCMPDI2O4AMXEJL4/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-25T18:04:12Z","links":{"resolver":"https://pith.science/pith/BJGDB2TGZWWCMPDI2O4AMXEJL4","bundle":"https://pith.science/pith/BJGDB2TGZWWCMPDI2O4AMXEJL4/bundle.json","state":"https://pith.science/pith/BJGDB2TGZWWCMPDI2O4AMXEJL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BJGDB2TGZWWCMPDI2O4AMXEJL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BJGDB2TGZWWCMPDI2O4AMXEJL4","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":"857025e8c3fb61ee3f1a51111b753cfda4c5b5f1da33e6f6ad9f7380b2c9b11e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-06T21:37:56Z","title_canon_sha256":"c07cb25114a4df7d14b920063ac82b6e93d970f55645eb4f878049aef859a451"},"schema_version":"1.0","source":{"id":"1408.1431","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1431","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1431v1","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1431","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"pith_short_12","alias_value":"BJGDB2TGZWWC","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BJGDB2TGZWWCMPDI","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BJGDB2TG","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:ee445f4a598d6b46d0b216b6b4e5585d56915ce52f8cc88cca8aeb12123f74e1","target":"graph","created_at":"2026-05-18T02:45:40Z","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":"We present a fast combinatorial $3/4$-approximation algorithm for the maximum asymmetric TSP with weights zero and one. The approximation factor of this algorithm matches the currently best one given by Bl\\\"aser in 2004 and based on linear programming. Our algorithm first computes a maximum size matching and a maximum weight cycle cover without certain cycles of length two but possibly with {\\em half-edges} - a half-edge of a given edge $e$ is informally speaking a half of $e$ that contains one of the endpoints of $e$. Then from the computed matching and cycle cover it extracts a set of paths,","authors_text":"Katarzyna Paluch","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-06T21:37:56Z","title":"Maximum ATSP with Weights Zero and One via Half-Edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1431","kind":"arxiv","version":1},"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:d71ba95f23e277933c641b145c5a565c21b20559f4ba1ca0046283c79f957ee8","target":"record","created_at":"2026-05-18T02:45:40Z","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":"857025e8c3fb61ee3f1a51111b753cfda4c5b5f1da33e6f6ad9f7380b2c9b11e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-06T21:37:56Z","title_canon_sha256":"c07cb25114a4df7d14b920063ac82b6e93d970f55645eb4f878049aef859a451"},"schema_version":"1.0","source":{"id":"1408.1431","kind":"arxiv","version":1}},"canonical_sha256":"0a4c30ea66cdac263c68d3b8065c895f1eb4c65cc6cf54c75d4f238f478e782e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a4c30ea66cdac263c68d3b8065c895f1eb4c65cc6cf54c75d4f238f478e782e","first_computed_at":"2026-05-18T02:45:40.547808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:40.547808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V+0mYYM+nzcUjCziqG1Qmaoysb+G2FxUKuKph7LTec6bjSOUUclYj8stuOhmQ50NGo2usyc4Ua9iwVovy90bCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:40.548509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1431","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d71ba95f23e277933c641b145c5a565c21b20559f4ba1ca0046283c79f957ee8","sha256:ee445f4a598d6b46d0b216b6b4e5585d56915ce52f8cc88cca8aeb12123f74e1"],"state_sha256":"97411b06d26894b2cbd61760580edad96db571f8bbda686bc950bf0edd266367"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j67xA5Ro0fNZgUn/roab3zrwO4yUpmFdT0CLZ8Y7E6JO5gE8CJg5rhw5Gnb/vpyhMAni7Hm8cSGr4OjY/5q+BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T18:04:12.751245Z","bundle_sha256":"5c820d5029444746ae4f29de57cf7456db6d3b3ee4782361067d531a7e445ba9"}}