{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IRKY45PYJCWYS7FAIRB37TMJUM","short_pith_number":"pith:IRKY45PY","canonical_record":{"source":{"id":"1801.09407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-29T09:08:55Z","cross_cats_sorted":[],"title_canon_sha256":"1801aa0c2b77161a1f269243946e54a763bd9ce335175504d410a22892a5d4eb","abstract_canon_sha256":"afb524aea4c35bb7c129868e3af7506b51d608dc6bd033526a8daefc3f5e185f"},"schema_version":"1.0"},"canonical_sha256":"44558e75f848ad897ca04443bfcd89a30a3ccdb35a22b0b36ce944b345661089","source":{"kind":"arxiv","id":"1801.09407","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09407","created_at":"2026-05-18T00:24:57Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09407v1","created_at":"2026-05-18T00:24:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09407","created_at":"2026-05-18T00:24:57Z"},{"alias_kind":"pith_short_12","alias_value":"IRKY45PYJCWY","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IRKY45PYJCWYS7FA","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IRKY45PY","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IRKY45PYJCWYS7FAIRB37TMJUM","target":"record","payload":{"canonical_record":{"source":{"id":"1801.09407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-29T09:08:55Z","cross_cats_sorted":[],"title_canon_sha256":"1801aa0c2b77161a1f269243946e54a763bd9ce335175504d410a22892a5d4eb","abstract_canon_sha256":"afb524aea4c35bb7c129868e3af7506b51d608dc6bd033526a8daefc3f5e185f"},"schema_version":"1.0"},"canonical_sha256":"44558e75f848ad897ca04443bfcd89a30a3ccdb35a22b0b36ce944b345661089","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:57.525766Z","signature_b64":"TLtLTZs2IQ0ryuK4wnGautMiVXQFH7lzjo3hyDIb0cC6DMKF7A4+bj/CulEeJEtePYKrXt84a6SHNE15ukmoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44558e75f848ad897ca04443bfcd89a30a3ccdb35a22b0b36ce944b345661089","last_reissued_at":"2026-05-18T00:24:57.525112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:57.525112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.09407","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-18T00:24:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hqDUDBcdj+PIGGA3+nwTJ52/+OKcu8BYZDe3nLoJkF40Qr5Bz/MZDDAHsrkIQRV7szTlWP8ZHd13B+JcY9P2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:22:34.350697Z"},"content_sha256":"f133aaae0fa2f8a3ee3ab679cbf4a42cd6fece29cf57d80e1c1147e614a90d1e","schema_version":"1.0","event_id":"sha256:f133aaae0fa2f8a3ee3ab679cbf4a42cd6fece29cf57d80e1c1147e614a90d1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IRKY45PYJCWYS7FAIRB37TMJUM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jeffrey Remmel, Yong Wang","submitted_at":"2018-01-29T09:08:55Z","abstract_excerpt":"In this paper, an iterative algorithm is designed to compute the sparse graphs for traveling salesman problem (TSP) according to the frequency quadrilaterals so that the computation time of the algorithms for TSP will be lowered. At each computation cycle, the algorithm first computes the average frequency \\bar{f}(e) of an edge e with N frequency quadrilaterals containing e in the input graph G(V,E). Then the 1/3|E| edges with low frequency are eliminated to generate the output graph with a smaller number of edges. The algorithm can be iterated several times and the original optimal Hamiltonia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09407","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-18T00:24:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m+IOy5pm8BvYOwdqcwnqT62+ASgSx9Mr9752T320Q5NNOtOqqmPio7dQ4v9xbvvob+APyeU6HVfDQAsLovvIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:22:34.351446Z"},"content_sha256":"1ed3bb3ce55a4e2dfe83470e1195ba8848aba73d4795d9b8176bd61fcdf8ccdf","schema_version":"1.0","event_id":"sha256:1ed3bb3ce55a4e2dfe83470e1195ba8848aba73d4795d9b8176bd61fcdf8ccdf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IRKY45PYJCWYS7FAIRB37TMJUM/bundle.json","state_url":"https://pith.science/pith/IRKY45PYJCWYS7FAIRB37TMJUM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IRKY45PYJCWYS7FAIRB37TMJUM/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-06T08:22:34Z","links":{"resolver":"https://pith.science/pith/IRKY45PYJCWYS7FAIRB37TMJUM","bundle":"https://pith.science/pith/IRKY45PYJCWYS7FAIRB37TMJUM/bundle.json","state":"https://pith.science/pith/IRKY45PYJCWYS7FAIRB37TMJUM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IRKY45PYJCWYS7FAIRB37TMJUM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IRKY45PYJCWYS7FAIRB37TMJUM","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":"afb524aea4c35bb7c129868e3af7506b51d608dc6bd033526a8daefc3f5e185f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-29T09:08:55Z","title_canon_sha256":"1801aa0c2b77161a1f269243946e54a763bd9ce335175504d410a22892a5d4eb"},"schema_version":"1.0","source":{"id":"1801.09407","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09407","created_at":"2026-05-18T00:24:57Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09407v1","created_at":"2026-05-18T00:24:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09407","created_at":"2026-05-18T00:24:57Z"},{"alias_kind":"pith_short_12","alias_value":"IRKY45PYJCWY","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IRKY45PYJCWYS7FA","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IRKY45PY","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:1ed3bb3ce55a4e2dfe83470e1195ba8848aba73d4795d9b8176bd61fcdf8ccdf","target":"graph","created_at":"2026-05-18T00:24:57Z","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":"In this paper, an iterative algorithm is designed to compute the sparse graphs for traveling salesman problem (TSP) according to the frequency quadrilaterals so that the computation time of the algorithms for TSP will be lowered. At each computation cycle, the algorithm first computes the average frequency \\bar{f}(e) of an edge e with N frequency quadrilaterals containing e in the input graph G(V,E). Then the 1/3|E| edges with low frequency are eliminated to generate the output graph with a smaller number of edges. The algorithm can be iterated several times and the original optimal Hamiltonia","authors_text":"Jeffrey Remmel, Yong Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-29T09:08:55Z","title":"A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09407","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:f133aaae0fa2f8a3ee3ab679cbf4a42cd6fece29cf57d80e1c1147e614a90d1e","target":"record","created_at":"2026-05-18T00:24:57Z","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":"afb524aea4c35bb7c129868e3af7506b51d608dc6bd033526a8daefc3f5e185f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-29T09:08:55Z","title_canon_sha256":"1801aa0c2b77161a1f269243946e54a763bd9ce335175504d410a22892a5d4eb"},"schema_version":"1.0","source":{"id":"1801.09407","kind":"arxiv","version":1}},"canonical_sha256":"44558e75f848ad897ca04443bfcd89a30a3ccdb35a22b0b36ce944b345661089","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44558e75f848ad897ca04443bfcd89a30a3ccdb35a22b0b36ce944b345661089","first_computed_at":"2026-05-18T00:24:57.525112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:57.525112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TLtLTZs2IQ0ryuK4wnGautMiVXQFH7lzjo3hyDIb0cC6DMKF7A4+bj/CulEeJEtePYKrXt84a6SHNE15ukmoAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:57.525766Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.09407","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f133aaae0fa2f8a3ee3ab679cbf4a42cd6fece29cf57d80e1c1147e614a90d1e","sha256:1ed3bb3ce55a4e2dfe83470e1195ba8848aba73d4795d9b8176bd61fcdf8ccdf"],"state_sha256":"1dc77d3af169c1748663f213c9543d9cbe4a59be4cbdc2e1b4eb1b04339b36b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8A1JS9Z4sBZPNwVzEOTJbLBoIsYi22liXQyvv+ZyPJzavluRU70Iy/1Ecy81b3e+QIVJ/Te37EYoTj/w9OvnAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:22:34.355443Z","bundle_sha256":"1fcf4c2e07bc1a43ee088fb0807913575a8e56873fcf35a3265fc749c29ff1d2"}}