{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6LFZ52D24CT7ZTJ2O2UNLN6MSR","short_pith_number":"pith:6LFZ52D2","schema_version":"1.0","canonical_sha256":"f2cb9ee87ae0a7fccd3a76a8d5b7cc945033e181f42e76ed1f7ada3f1cff0780","source":{"kind":"arxiv","id":"1305.6693","version":1},"attestation_state":"computed","paper":{"title":"Drawing the double circle on a grid of minimum size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"David Flores-Pe\\~naloza, Mario Lopez, Pablo P\\'erez-Lantero, Ruy Fabila-Monroy, Sergey Bereg","submitted_at":"2013-05-29T04:56:57Z","abstract_excerpt":"In 1926, Jarn\\'ik introduced the problem of drawing a convex $n$-gon with vertices having integer coordinates. He constructed such a drawing in the grid $[1,c\\cdot n^{3/2}]^2$ for some constant $c>0$, and showed that this grid size is optimal up to a constant factor. We consider the analogous problem for drawing the double circle, and prove that it can be done within the same grid size. Moreover, we give an O(n)-time algorithm to construct such a point set."},"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":"1305.6693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-29T04:56:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f09581ca29b28dfd4e7e8b1ad15df14a067b4a15cd90530d2098e827167390e6","abstract_canon_sha256":"5cf185877a4d114f4cac84304eccedb553a5820f33723bc5ef222ae65ba93c97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:18.089628Z","signature_b64":"NUhgrpO4HDXK74Dx0GPWS0t5rZ4Ws3nWZUlIRS3znYIn+rLRzzYIH+XVariE2TCnFULW7Mk7NkE06SgTJhhPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2cb9ee87ae0a7fccd3a76a8d5b7cc945033e181f42e76ed1f7ada3f1cff0780","last_reissued_at":"2026-05-18T03:22:18.089189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:18.089189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Drawing the double circle on a grid of minimum size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"David Flores-Pe\\~naloza, Mario Lopez, Pablo P\\'erez-Lantero, Ruy Fabila-Monroy, Sergey Bereg","submitted_at":"2013-05-29T04:56:57Z","abstract_excerpt":"In 1926, Jarn\\'ik introduced the problem of drawing a convex $n$-gon with vertices having integer coordinates. He constructed such a drawing in the grid $[1,c\\cdot n^{3/2}]^2$ for some constant $c>0$, and showed that this grid size is optimal up to a constant factor. We consider the analogous problem for drawing the double circle, and prove that it can be done within the same grid size. Moreover, we give an O(n)-time algorithm to construct such a point set."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6693","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":"1305.6693","created_at":"2026-05-18T03:22:18.089250+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.6693v1","created_at":"2026-05-18T03:22:18.089250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6693","created_at":"2026-05-18T03:22:18.089250+00:00"},{"alias_kind":"pith_short_12","alias_value":"6LFZ52D24CT7","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6LFZ52D24CT7ZTJ2","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6LFZ52D2","created_at":"2026-05-18T12:27:36.564083+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/6LFZ52D24CT7ZTJ2O2UNLN6MSR","json":"https://pith.science/pith/6LFZ52D24CT7ZTJ2O2UNLN6MSR.json","graph_json":"https://pith.science/api/pith-number/6LFZ52D24CT7ZTJ2O2UNLN6MSR/graph.json","events_json":"https://pith.science/api/pith-number/6LFZ52D24CT7ZTJ2O2UNLN6MSR/events.json","paper":"https://pith.science/paper/6LFZ52D2"},"agent_actions":{"view_html":"https://pith.science/pith/6LFZ52D24CT7ZTJ2O2UNLN6MSR","download_json":"https://pith.science/pith/6LFZ52D24CT7ZTJ2O2UNLN6MSR.json","view_paper":"https://pith.science/paper/6LFZ52D2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.6693&json=true","fetch_graph":"https://pith.science/api/pith-number/6LFZ52D24CT7ZTJ2O2UNLN6MSR/graph.json","fetch_events":"https://pith.science/api/pith-number/6LFZ52D24CT7ZTJ2O2UNLN6MSR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6LFZ52D24CT7ZTJ2O2UNLN6MSR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6LFZ52D24CT7ZTJ2O2UNLN6MSR/action/storage_attestation","attest_author":"https://pith.science/pith/6LFZ52D24CT7ZTJ2O2UNLN6MSR/action/author_attestation","sign_citation":"https://pith.science/pith/6LFZ52D24CT7ZTJ2O2UNLN6MSR/action/citation_signature","submit_replication":"https://pith.science/pith/6LFZ52D24CT7ZTJ2O2UNLN6MSR/action/replication_record"}},"created_at":"2026-05-18T03:22:18.089250+00:00","updated_at":"2026-05-18T03:22:18.089250+00:00"}