{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RUQJGN5BS5XE2TSYB5MRYWMNQM","short_pith_number":"pith:RUQJGN5B","canonical_record":{"source":{"id":"1206.3437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-15T12:15:31Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"9f3c64e9b06763adb8fe72342b6de2bfbde968b5317d32753a0cefd4be0d0c9f","abstract_canon_sha256":"dfe8a0c35745870971f769ced6f6814286dafb9720761ea6e1f7495b3051493c"},"schema_version":"1.0"},"canonical_sha256":"8d209337a1976e4d4e580f591c598d833cb4c7a983d57116b7a3de132715ac5b","source":{"kind":"arxiv","id":"1206.3437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3437","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3437v1","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3437","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"RUQJGN5BS5XE","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RUQJGN5BS5XE2TSY","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RUQJGN5B","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RUQJGN5BS5XE2TSYB5MRYWMNQM","target":"record","payload":{"canonical_record":{"source":{"id":"1206.3437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-15T12:15:31Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"9f3c64e9b06763adb8fe72342b6de2bfbde968b5317d32753a0cefd4be0d0c9f","abstract_canon_sha256":"dfe8a0c35745870971f769ced6f6814286dafb9720761ea6e1f7495b3051493c"},"schema_version":"1.0"},"canonical_sha256":"8d209337a1976e4d4e580f591c598d833cb4c7a983d57116b7a3de132715ac5b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:30.301943Z","signature_b64":"ikAqeW6oRWVXI0/3/BNiLR7tuBQ2lzPS1e0RGETkKcRg5uiUYZTezu4U5OhIybrWQ0DZ+FVVlRQ2MtOPv36YAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d209337a1976e4d4e580f591c598d833cb4c7a983d57116b7a3de132715ac5b","last_reissued_at":"2026-05-18T03:53:30.301292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:30.301292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.3437","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-18T03:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vqcc0BoQQUzAScdcV/gQuXqm4ia+TRMCtMd3zY6Tlf2U4QtQ3F5QE42Y2nBsDd7iNvYsZOs7Dsbxi74bZWktAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:12:15.898349Z"},"content_sha256":"b7b580748b193cb6f57a41642d0172ea907a60274a45e32f4463e3c6d336da0b","schema_version":"1.0","event_id":"sha256:b7b580748b193cb6f57a41642d0172ea907a60274a45e32f4463e3c6d336da0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RUQJGN5BS5XE2TSYB5MRYWMNQM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving the Asymmetric TSP by Considering Graph Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.DM","authors_text":"Jean-Guillaume Fages, Xavier Lorca","submitted_at":"2012-06-15T12:15:31Z","abstract_excerpt":"Recent works on cost based relaxations have improved Constraint Programming (CP) models for the Traveling Salesman Problem (TSP). We provide a short survey over solving asymmetric TSP with CP. Then, we suggest new implied propagators based on general graph properties. We experimentally show that such implied propagators bring robustness to pathological instances and highlight the fact that graph structure can significantly improve search heuristics behavior. Finally, we show that our approach outperforms current state of the art results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3437","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-18T03:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wkK9tulr+8z4+br4J9q7wnW4ZU1RNFFD0XXVIXu+wsdWwO0PFxx+cFhUs9frGR/XPjmuf6ThLAP6/sO8vuKPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:12:15.899066Z"},"content_sha256":"5442469cb161950eef062e00afef1daf5c0b32330b282dec895d9fe17bf457d8","schema_version":"1.0","event_id":"sha256:5442469cb161950eef062e00afef1daf5c0b32330b282dec895d9fe17bf457d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RUQJGN5BS5XE2TSYB5MRYWMNQM/bundle.json","state_url":"https://pith.science/pith/RUQJGN5BS5XE2TSYB5MRYWMNQM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RUQJGN5BS5XE2TSYB5MRYWMNQM/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-05-26T05:12:15Z","links":{"resolver":"https://pith.science/pith/RUQJGN5BS5XE2TSYB5MRYWMNQM","bundle":"https://pith.science/pith/RUQJGN5BS5XE2TSYB5MRYWMNQM/bundle.json","state":"https://pith.science/pith/RUQJGN5BS5XE2TSYB5MRYWMNQM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RUQJGN5BS5XE2TSYB5MRYWMNQM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RUQJGN5BS5XE2TSYB5MRYWMNQM","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":"dfe8a0c35745870971f769ced6f6814286dafb9720761ea6e1f7495b3051493c","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-15T12:15:31Z","title_canon_sha256":"9f3c64e9b06763adb8fe72342b6de2bfbde968b5317d32753a0cefd4be0d0c9f"},"schema_version":"1.0","source":{"id":"1206.3437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3437","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3437v1","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3437","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"RUQJGN5BS5XE","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RUQJGN5BS5XE2TSY","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RUQJGN5B","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:5442469cb161950eef062e00afef1daf5c0b32330b282dec895d9fe17bf457d8","target":"graph","created_at":"2026-05-18T03:53:30Z","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":"Recent works on cost based relaxations have improved Constraint Programming (CP) models for the Traveling Salesman Problem (TSP). We provide a short survey over solving asymmetric TSP with CP. Then, we suggest new implied propagators based on general graph properties. We experimentally show that such implied propagators bring robustness to pathological instances and highlight the fact that graph structure can significantly improve search heuristics behavior. Finally, we show that our approach outperforms current state of the art results.","authors_text":"Jean-Guillaume Fages, Xavier Lorca","cross_cats":["cs.AI","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-15T12:15:31Z","title":"Improving the Asymmetric TSP by Considering Graph Structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3437","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:b7b580748b193cb6f57a41642d0172ea907a60274a45e32f4463e3c6d336da0b","target":"record","created_at":"2026-05-18T03:53:30Z","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":"dfe8a0c35745870971f769ced6f6814286dafb9720761ea6e1f7495b3051493c","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-15T12:15:31Z","title_canon_sha256":"9f3c64e9b06763adb8fe72342b6de2bfbde968b5317d32753a0cefd4be0d0c9f"},"schema_version":"1.0","source":{"id":"1206.3437","kind":"arxiv","version":1}},"canonical_sha256":"8d209337a1976e4d4e580f591c598d833cb4c7a983d57116b7a3de132715ac5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d209337a1976e4d4e580f591c598d833cb4c7a983d57116b7a3de132715ac5b","first_computed_at":"2026-05-18T03:53:30.301292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:30.301292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ikAqeW6oRWVXI0/3/BNiLR7tuBQ2lzPS1e0RGETkKcRg5uiUYZTezu4U5OhIybrWQ0DZ+FVVlRQ2MtOPv36YAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:30.301943Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7b580748b193cb6f57a41642d0172ea907a60274a45e32f4463e3c6d336da0b","sha256:5442469cb161950eef062e00afef1daf5c0b32330b282dec895d9fe17bf457d8"],"state_sha256":"878a24b5312266f637f28d7ac1841090c6252e72ff0328da306938f241d4e800"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G2EUrexXgb6qJD16TggJgb5PwkovjyPAwW8pjEDSJEsKNG9GtczjDItjLQcTaW/TX3/rTv0YmYMer4PDRLRGBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:12:15.902926Z","bundle_sha256":"3face9f0127ee21e0662f08275cb5d77c39e43b79d7c47dbafcc255759814996"}}