{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Q42HD2VN2CLSWFMH3D2YXOQ3XH","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":"f6c39bcc872cf41634ccfb081f9e4970ca59a626e2c804bc24e753bc4b0d7ff8","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-09T14:39:51Z","title_canon_sha256":"58de4d8581c390ed2fb7c402c333ea4a7e85875be75aadf8a65a520dc1f21abd"},"schema_version":"1.0","source":{"id":"1606.02978","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02978","created_at":"2026-05-18T01:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02978v1","created_at":"2026-05-18T01:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02978","created_at":"2026-05-18T01:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"Q42HD2VN2CLS","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q42HD2VN2CLSWFMH","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q42HD2VN","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:1c5812828248f453750a79e4e9413b5a7a37f1a5769cbe759071e5806af8b5dd","target":"graph","created_at":"2026-05-18T01:12:38Z","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 tight upper and lower bounds for the traveling salesman path through the points of two-dimensional modular lattices. We use these results to bound the traveling salesman path of two-dimensional Kronecker point sets. Our results rely on earlier work on shortest vectors in lattices as well as on the strong convergence of Jacobi-Perron type algorithms.","authors_text":"Florian Pausinger","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-09T14:39:51Z","title":"Bounds for the traveling salesman paths of two-dimensional modular lattices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02978","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:0a1c3850a5c438c179b490c9d7353555377f805c3afecad7cfab0953f83a62e1","target":"record","created_at":"2026-05-18T01:12:38Z","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":"f6c39bcc872cf41634ccfb081f9e4970ca59a626e2c804bc24e753bc4b0d7ff8","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-09T14:39:51Z","title_canon_sha256":"58de4d8581c390ed2fb7c402c333ea4a7e85875be75aadf8a65a520dc1f21abd"},"schema_version":"1.0","source":{"id":"1606.02978","kind":"arxiv","version":1}},"canonical_sha256":"873471eaadd0972b1587d8f58bba1bb9e2e2c57389cda5265c393362a50ee92e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"873471eaadd0972b1587d8f58bba1bb9e2e2c57389cda5265c393362a50ee92e","first_computed_at":"2026-05-18T01:12:38.508722Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:38.508722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yBDlbgG+zb57yLRAmp2IA1PIsmkWLBJA424zutMMJ4+mzq20BBlwNEB71EBDtEklBskKCy+yuJHdj5ts0cCsDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:38.509109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.02978","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a1c3850a5c438c179b490c9d7353555377f805c3afecad7cfab0953f83a62e1","sha256:1c5812828248f453750a79e4e9413b5a7a37f1a5769cbe759071e5806af8b5dd"],"state_sha256":"4a3ba3ab008f12f03b5ea57d27d904512869da6e22c3f0e011b5a33e6f3102d2"}