{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZLLGMQXRQ3NU72JDHWTMF7FYBX","short_pith_number":"pith:ZLLGMQXR","schema_version":"1.0","canonical_sha256":"cad66642f186db4fe9233da6c2fcb80dec9434e07c44ed35693c4c971bc4fcbe","source":{"kind":"arxiv","id":"1401.6387","version":1},"attestation_state":"computed","paper":{"title":"Squaring the square with integer linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Sascha Kurz","submitted_at":"2014-01-24T16:05:39Z","abstract_excerpt":"We consider so-called squaring the square-puzzles where a given square (or rectangle) should be dissected into smaller squares. For a specific instance of such problems we demonstrate that a mathematically rigorous solution can be quite involved. As an alternative to exhaustive enumeration using tailored algorithms we describe the general approach of formulating the problem as an integer linear program."},"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":"1401.6387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-24T16:05:39Z","cross_cats_sorted":[],"title_canon_sha256":"81b17b0304d85f21a9644f68a5e47aa957d90b39fd4e91662ac346ccceee2444","abstract_canon_sha256":"a2bc48a7ae09ad7d7ab1b54fe40e063e82e7c0cd77649c5a4eeac36d6cdb4a61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:12.212199Z","signature_b64":"i7N1XKXzpheyK5aLvO8inVz9A/olTxN23blOnQAg029TUJpvD1Qa5Cnp9q1H4ksgpgBNrz5/eciu4lmrp04LBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cad66642f186db4fe9233da6c2fcb80dec9434e07c44ed35693c4c971bc4fcbe","last_reissued_at":"2026-05-18T03:01:12.211416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:12.211416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Squaring the square with integer linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Sascha Kurz","submitted_at":"2014-01-24T16:05:39Z","abstract_excerpt":"We consider so-called squaring the square-puzzles where a given square (or rectangle) should be dissected into smaller squares. For a specific instance of such problems we demonstrate that a mathematically rigorous solution can be quite involved. As an alternative to exhaustive enumeration using tailored algorithms we describe the general approach of formulating the problem as an integer linear program."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6387","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":"1401.6387","created_at":"2026-05-18T03:01:12.211551+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6387v1","created_at":"2026-05-18T03:01:12.211551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6387","created_at":"2026-05-18T03:01:12.211551+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZLLGMQXRQ3NU","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZLLGMQXRQ3NU72JD","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZLLGMQXR","created_at":"2026-05-18T12:28:59.999130+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/ZLLGMQXRQ3NU72JDHWTMF7FYBX","json":"https://pith.science/pith/ZLLGMQXRQ3NU72JDHWTMF7FYBX.json","graph_json":"https://pith.science/api/pith-number/ZLLGMQXRQ3NU72JDHWTMF7FYBX/graph.json","events_json":"https://pith.science/api/pith-number/ZLLGMQXRQ3NU72JDHWTMF7FYBX/events.json","paper":"https://pith.science/paper/ZLLGMQXR"},"agent_actions":{"view_html":"https://pith.science/pith/ZLLGMQXRQ3NU72JDHWTMF7FYBX","download_json":"https://pith.science/pith/ZLLGMQXRQ3NU72JDHWTMF7FYBX.json","view_paper":"https://pith.science/paper/ZLLGMQXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6387&json=true","fetch_graph":"https://pith.science/api/pith-number/ZLLGMQXRQ3NU72JDHWTMF7FYBX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZLLGMQXRQ3NU72JDHWTMF7FYBX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZLLGMQXRQ3NU72JDHWTMF7FYBX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZLLGMQXRQ3NU72JDHWTMF7FYBX/action/storage_attestation","attest_author":"https://pith.science/pith/ZLLGMQXRQ3NU72JDHWTMF7FYBX/action/author_attestation","sign_citation":"https://pith.science/pith/ZLLGMQXRQ3NU72JDHWTMF7FYBX/action/citation_signature","submit_replication":"https://pith.science/pith/ZLLGMQXRQ3NU72JDHWTMF7FYBX/action/replication_record"}},"created_at":"2026-05-18T03:01:12.211551+00:00","updated_at":"2026-05-18T03:01:12.211551+00:00"}