{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GUWP5ZSY3B2U5M4VJZWUCXBOMT","short_pith_number":"pith:GUWP5ZSY","schema_version":"1.0","canonical_sha256":"352cfee658d8754eb3954e6d415c2e64d4361a50801a1dab1b6ce752ae972bf4","source":{"kind":"arxiv","id":"1312.2318","version":1},"attestation_state":"computed","paper":{"title":"Constructing $7$-clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chuck Simmons, Landon Curt Noll, Randall Rathbun, Sascha Kurz","submitted_at":"2013-12-09T06:32:49Z","abstract_excerpt":"A set of $n$-lattice points in the plane, no three on a line and no four on a circle, such that all pairwise distances and all coordinates are integral is called an $n$-cluster (in $\\mathbb{R}^2$). We determine the smallest existent $7$-cluster with respect to its diameter. Additionally we provide a toolbox of algorithms which allowed us to computationally locate over 1000 different $7$-clusters, some of them having huge integer edge lengths. On the way, we exhaustively determined all Heronian triangles with largest edge length up to $6\\cdot 10^6$."},"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":"1312.2318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-09T06:32:49Z","cross_cats_sorted":[],"title_canon_sha256":"23911b757dc1f61191d49b2f65b09a76431c8e4da3608e589e3c7277140c7761","abstract_canon_sha256":"506f803a27a166e7bd3e6ca68a87f4c16558a5e3f063e49dfbd7e8ae54f3ea8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:10.709224Z","signature_b64":"hCiOTZE+cPBHv407S+ivbyu9Dh61kg3ENyvuj/JhrXHi6ocg7APPbpEOKvhGQat6otIHZ4N/woenijRWcEL8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"352cfee658d8754eb3954e6d415c2e64d4361a50801a1dab1b6ce752ae972bf4","last_reissued_at":"2026-05-18T03:05:10.708734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:10.708734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing $7$-clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chuck Simmons, Landon Curt Noll, Randall Rathbun, Sascha Kurz","submitted_at":"2013-12-09T06:32:49Z","abstract_excerpt":"A set of $n$-lattice points in the plane, no three on a line and no four on a circle, such that all pairwise distances and all coordinates are integral is called an $n$-cluster (in $\\mathbb{R}^2$). We determine the smallest existent $7$-cluster with respect to its diameter. Additionally we provide a toolbox of algorithms which allowed us to computationally locate over 1000 different $7$-clusters, some of them having huge integer edge lengths. On the way, we exhaustively determined all Heronian triangles with largest edge length up to $6\\cdot 10^6$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2318","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":"1312.2318","created_at":"2026-05-18T03:05:10.708817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.2318v1","created_at":"2026-05-18T03:05:10.708817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2318","created_at":"2026-05-18T03:05:10.708817+00:00"},{"alias_kind":"pith_short_12","alias_value":"GUWP5ZSY3B2U","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GUWP5ZSY3B2U5M4V","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GUWP5ZSY","created_at":"2026-05-18T12:27:45.050594+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.09331","citing_title":"On diameter bounds for planar integral point sets in semi-general position","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GUWP5ZSY3B2U5M4VJZWUCXBOMT","json":"https://pith.science/pith/GUWP5ZSY3B2U5M4VJZWUCXBOMT.json","graph_json":"https://pith.science/api/pith-number/GUWP5ZSY3B2U5M4VJZWUCXBOMT/graph.json","events_json":"https://pith.science/api/pith-number/GUWP5ZSY3B2U5M4VJZWUCXBOMT/events.json","paper":"https://pith.science/paper/GUWP5ZSY"},"agent_actions":{"view_html":"https://pith.science/pith/GUWP5ZSY3B2U5M4VJZWUCXBOMT","download_json":"https://pith.science/pith/GUWP5ZSY3B2U5M4VJZWUCXBOMT.json","view_paper":"https://pith.science/paper/GUWP5ZSY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.2318&json=true","fetch_graph":"https://pith.science/api/pith-number/GUWP5ZSY3B2U5M4VJZWUCXBOMT/graph.json","fetch_events":"https://pith.science/api/pith-number/GUWP5ZSY3B2U5M4VJZWUCXBOMT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GUWP5ZSY3B2U5M4VJZWUCXBOMT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GUWP5ZSY3B2U5M4VJZWUCXBOMT/action/storage_attestation","attest_author":"https://pith.science/pith/GUWP5ZSY3B2U5M4VJZWUCXBOMT/action/author_attestation","sign_citation":"https://pith.science/pith/GUWP5ZSY3B2U5M4VJZWUCXBOMT/action/citation_signature","submit_replication":"https://pith.science/pith/GUWP5ZSY3B2U5M4VJZWUCXBOMT/action/replication_record"}},"created_at":"2026-05-18T03:05:10.708817+00:00","updated_at":"2026-05-18T03:05:10.708817+00:00"}