{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E5WDIG7PBZ2PNNCKIKG75XMXHL","short_pith_number":"pith:E5WDIG7P","canonical_record":{"source":{"id":"1802.01545","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-02-05T18:15:10Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0b366d2aeb78a5407b8c17d4a57ae3639219b1488de80a1cf17613a70165121e","abstract_canon_sha256":"72926525f62106e00b17e4c8775e010310f3186858384bd19e9bfdad66138331"},"schema_version":"1.0"},"canonical_sha256":"276c341bef0e74f6b44a428dfedd973ac0843c7289dcd207fbeb6ac93fea78fc","source":{"kind":"arxiv","id":"1802.01545","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01545","created_at":"2026-05-18T00:15:16Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01545v3","created_at":"2026-05-18T00:15:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01545","created_at":"2026-05-18T00:15:16Z"},{"alias_kind":"pith_short_12","alias_value":"E5WDIG7PBZ2P","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E5WDIG7PBZ2PNNCK","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E5WDIG7P","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E5WDIG7PBZ2PNNCKIKG75XMXHL","target":"record","payload":{"canonical_record":{"source":{"id":"1802.01545","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-02-05T18:15:10Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0b366d2aeb78a5407b8c17d4a57ae3639219b1488de80a1cf17613a70165121e","abstract_canon_sha256":"72926525f62106e00b17e4c8775e010310f3186858384bd19e9bfdad66138331"},"schema_version":"1.0"},"canonical_sha256":"276c341bef0e74f6b44a428dfedd973ac0843c7289dcd207fbeb6ac93fea78fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:16.376908Z","signature_b64":"q3t26+gseZYy07bDWgK7G05PKjr3+d+0FG31S9Bk3IAH4Rh2tnvJQZwx2zinlh9DuDOXhpTf2uqe9dzWNl+ECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"276c341bef0e74f6b44a428dfedd973ac0843c7289dcd207fbeb6ac93fea78fc","last_reissued_at":"2026-05-18T00:15:16.376454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:16.376454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.01545","source_version":3,"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-18T00:15:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sqOJm8gjPgkvSHwJWtjIFpYONqhhdWH42O1zsn2iDIjue8efS6FhVYQ2DHcXiR+mwpmkzBsgptbaIcorjYn+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:15.024245Z"},"content_sha256":"1a92d07ec87601a781368721ff3f87d2db7b84e4919f4815e1f8e85873f2094b","schema_version":"1.0","event_id":"sha256:1a92d07ec87601a781368721ff3f87d2db7b84e4919f4815e1f8e85873f2094b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E5WDIG7PBZ2PNNCKIKG75XMXHL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solution for a bipartite Euclidean traveling-salesman problem in one dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cond-mat.dis-nn","authors_text":"Andrea Di Gioacchino, Enrico M. Malatesta, Marco Gherardi, Sergio Caracciolo","submitted_at":"2018-02-05T18:15:10Z","abstract_excerpt":"The traveling salesman problem is one of the most studied combinatorial optimization problems, because of the simplicity in its statement and the difficulty in its solution. We characterize the optimal cycle for every convex and increasing cost function when the points are thrown independently and with an identical probability distribution in a compact interval. We compute the average optimal cost for every number of points when the distance function is the square of the Euclidean distance. We also show that the average optimal cost is not a self-averaging quantity by explicitly computing the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01545","kind":"arxiv","version":3},"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-18T00:15:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zzInUPbJofptrOlAz+ktTQrOSG2V6Nm4ZlsSjZBtz4bMf8sLzlcN38AuCWaWq4qe1UgLE8Cy6ioCoJgejRpzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:15.024706Z"},"content_sha256":"fd9f1f7adb373c9ecce2a2d07547924a22c4a89d6f7e9eabe98e9c8227cb1f04","schema_version":"1.0","event_id":"sha256:fd9f1f7adb373c9ecce2a2d07547924a22c4a89d6f7e9eabe98e9c8227cb1f04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E5WDIG7PBZ2PNNCKIKG75XMXHL/bundle.json","state_url":"https://pith.science/pith/E5WDIG7PBZ2PNNCKIKG75XMXHL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E5WDIG7PBZ2PNNCKIKG75XMXHL/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-30T12:05:15Z","links":{"resolver":"https://pith.science/pith/E5WDIG7PBZ2PNNCKIKG75XMXHL","bundle":"https://pith.science/pith/E5WDIG7PBZ2PNNCKIKG75XMXHL/bundle.json","state":"https://pith.science/pith/E5WDIG7PBZ2PNNCKIKG75XMXHL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E5WDIG7PBZ2PNNCKIKG75XMXHL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E5WDIG7PBZ2PNNCKIKG75XMXHL","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":"72926525f62106e00b17e4c8775e010310f3186858384bd19e9bfdad66138331","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-02-05T18:15:10Z","title_canon_sha256":"0b366d2aeb78a5407b8c17d4a57ae3639219b1488de80a1cf17613a70165121e"},"schema_version":"1.0","source":{"id":"1802.01545","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01545","created_at":"2026-05-18T00:15:16Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01545v3","created_at":"2026-05-18T00:15:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01545","created_at":"2026-05-18T00:15:16Z"},{"alias_kind":"pith_short_12","alias_value":"E5WDIG7PBZ2P","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E5WDIG7PBZ2PNNCK","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E5WDIG7P","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:fd9f1f7adb373c9ecce2a2d07547924a22c4a89d6f7e9eabe98e9c8227cb1f04","target":"graph","created_at":"2026-05-18T00:15:16Z","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":"The traveling salesman problem is one of the most studied combinatorial optimization problems, because of the simplicity in its statement and the difficulty in its solution. We characterize the optimal cycle for every convex and increasing cost function when the points are thrown independently and with an identical probability distribution in a compact interval. We compute the average optimal cost for every number of points when the distance function is the square of the Euclidean distance. We also show that the average optimal cost is not a self-averaging quantity by explicitly computing the ","authors_text":"Andrea Di Gioacchino, Enrico M. Malatesta, Marco Gherardi, Sergio Caracciolo","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-02-05T18:15:10Z","title":"Solution for a bipartite Euclidean traveling-salesman problem in one dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01545","kind":"arxiv","version":3},"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:1a92d07ec87601a781368721ff3f87d2db7b84e4919f4815e1f8e85873f2094b","target":"record","created_at":"2026-05-18T00:15:16Z","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":"72926525f62106e00b17e4c8775e010310f3186858384bd19e9bfdad66138331","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-02-05T18:15:10Z","title_canon_sha256":"0b366d2aeb78a5407b8c17d4a57ae3639219b1488de80a1cf17613a70165121e"},"schema_version":"1.0","source":{"id":"1802.01545","kind":"arxiv","version":3}},"canonical_sha256":"276c341bef0e74f6b44a428dfedd973ac0843c7289dcd207fbeb6ac93fea78fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"276c341bef0e74f6b44a428dfedd973ac0843c7289dcd207fbeb6ac93fea78fc","first_computed_at":"2026-05-18T00:15:16.376454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:16.376454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q3t26+gseZYy07bDWgK7G05PKjr3+d+0FG31S9Bk3IAH4Rh2tnvJQZwx2zinlh9DuDOXhpTf2uqe9dzWNl+ECA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:16.376908Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.01545","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a92d07ec87601a781368721ff3f87d2db7b84e4919f4815e1f8e85873f2094b","sha256:fd9f1f7adb373c9ecce2a2d07547924a22c4a89d6f7e9eabe98e9c8227cb1f04"],"state_sha256":"12f6d4d94cb7079f35644ec47e7ef11b38f6a9a5ccf79562c20690b7fe1a34a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sMgYXRnfCHzOLKz1uclI6gEpgzWlmAhC84C8whZ4IktEYZI/DEyFEK3UvEHNN6YP9/rQrNebnWflHSI4FRjZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:05:15.026943Z","bundle_sha256":"c208675b10e3964d65fa1f531fc40b5459355839d4c9cde23a78d2d81415a98d"}}