{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Q42HD2VN2CLSWFMH3D2YXOQ3XH","short_pith_number":"pith:Q42HD2VN","schema_version":"1.0","canonical_sha256":"873471eaadd0972b1587d8f58bba1bb9e2e2c57389cda5265c393362a50ee92e","source":{"kind":"arxiv","id":"1606.02978","version":1},"attestation_state":"computed","paper":{"title":"Bounds for the traveling salesman paths of two-dimensional modular lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Florian Pausinger","submitted_at":"2016-06-09T14:39:51Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1606.02978","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-09T14:39:51Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"58de4d8581c390ed2fb7c402c333ea4a7e85875be75aadf8a65a520dc1f21abd","abstract_canon_sha256":"f6c39bcc872cf41634ccfb081f9e4970ca59a626e2c804bc24e753bc4b0d7ff8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:38.509109Z","signature_b64":"yBDlbgG+zb57yLRAmp2IA1PIsmkWLBJA424zutMMJ4+mzq20BBlwNEB71EBDtEklBskKCy+yuJHdj5ts0cCsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"873471eaadd0972b1587d8f58bba1bb9e2e2c57389cda5265c393362a50ee92e","last_reissued_at":"2026-05-18T01:12:38.508722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:38.508722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds for the traveling salesman paths of two-dimensional modular lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Florian Pausinger","submitted_at":"2016-06-09T14:39:51Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02978","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.02978","created_at":"2026-05-18T01:12:38.508778+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.02978v1","created_at":"2026-05-18T01:12:38.508778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02978","created_at":"2026-05-18T01:12:38.508778+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q42HD2VN2CLS","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q42HD2VN2CLSWFMH","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q42HD2VN","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q42HD2VN2CLSWFMH3D2YXOQ3XH","json":"https://pith.science/pith/Q42HD2VN2CLSWFMH3D2YXOQ3XH.json","graph_json":"https://pith.science/api/pith-number/Q42HD2VN2CLSWFMH3D2YXOQ3XH/graph.json","events_json":"https://pith.science/api/pith-number/Q42HD2VN2CLSWFMH3D2YXOQ3XH/events.json","paper":"https://pith.science/paper/Q42HD2VN"},"agent_actions":{"view_html":"https://pith.science/pith/Q42HD2VN2CLSWFMH3D2YXOQ3XH","download_json":"https://pith.science/pith/Q42HD2VN2CLSWFMH3D2YXOQ3XH.json","view_paper":"https://pith.science/paper/Q42HD2VN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.02978&json=true","fetch_graph":"https://pith.science/api/pith-number/Q42HD2VN2CLSWFMH3D2YXOQ3XH/graph.json","fetch_events":"https://pith.science/api/pith-number/Q42HD2VN2CLSWFMH3D2YXOQ3XH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q42HD2VN2CLSWFMH3D2YXOQ3XH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q42HD2VN2CLSWFMH3D2YXOQ3XH/action/storage_attestation","attest_author":"https://pith.science/pith/Q42HD2VN2CLSWFMH3D2YXOQ3XH/action/author_attestation","sign_citation":"https://pith.science/pith/Q42HD2VN2CLSWFMH3D2YXOQ3XH/action/citation_signature","submit_replication":"https://pith.science/pith/Q42HD2VN2CLSWFMH3D2YXOQ3XH/action/replication_record"}},"created_at":"2026-05-18T01:12:38.508778+00:00","updated_at":"2026-05-18T01:12:38.508778+00:00"}