{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5E2J5HZ3IEBL2AOUGU4DATSK5H","short_pith_number":"pith:5E2J5HZ3","schema_version":"1.0","canonical_sha256":"e9349e9f3b4102bd01d43538304e4ae9d76db959a58fb745eba2b571648187e0","source":{"kind":"arxiv","id":"1405.2571","version":4},"attestation_state":"computed","paper":{"title":"An Efficient Local Search for Partial Latin Square Extension Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kazuya Haraguchi","submitted_at":"2014-05-11T19:07:55Z","abstract_excerpt":"A partial Latin square (PLS) is a partial assignment of n symbols to an nxn grid such that, in each row and in each column, each symbol appears at most once. The partial Latin square extension problem is an NP-hard problem that asks for a largest extension of a given PLS. In this paper we propose an efficient local search for this problem. We focus on the local search such that the neighborhood is defined by (p,q)-swap, i.e., removing exactly p symbols and then assigning symbols to at most q empty cells. For p in {1,2,3}, our neighborhood search algorithm finds an improved solution or conclude"},"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":"1405.2571","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-11T19:07:55Z","cross_cats_sorted":[],"title_canon_sha256":"cc5a8c13eaaf78a5029dc47087aade294f1cac56d26773ec395b9932864d0107","abstract_canon_sha256":"03b18d7e66fe67ef336b898c527f88dbbd08e8509e319fe70620b886f131fd5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:34.134694Z","signature_b64":"jD6PLXUjFot2rS9GmTIBphb2Md7b3aGDmIc7oSMLVURsfrjIjeXNZrhWyMcCSY0/SjckRagMx+qbb0SM+RJjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9349e9f3b4102bd01d43538304e4ae9d76db959a58fb745eba2b571648187e0","last_reissued_at":"2026-05-18T02:25:34.134250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:34.134250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Local Search for Partial Latin Square Extension Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kazuya Haraguchi","submitted_at":"2014-05-11T19:07:55Z","abstract_excerpt":"A partial Latin square (PLS) is a partial assignment of n symbols to an nxn grid such that, in each row and in each column, each symbol appears at most once. The partial Latin square extension problem is an NP-hard problem that asks for a largest extension of a given PLS. In this paper we propose an efficient local search for this problem. We focus on the local search such that the neighborhood is defined by (p,q)-swap, i.e., removing exactly p symbols and then assigning symbols to at most q empty cells. For p in {1,2,3}, our neighborhood search algorithm finds an improved solution or conclude"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2571","kind":"arxiv","version":4},"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":"1405.2571","created_at":"2026-05-18T02:25:34.134322+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.2571v4","created_at":"2026-05-18T02:25:34.134322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2571","created_at":"2026-05-18T02:25:34.134322+00:00"},{"alias_kind":"pith_short_12","alias_value":"5E2J5HZ3IEBL","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5E2J5HZ3IEBL2AOU","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5E2J5HZ3","created_at":"2026-05-18T12:28:14.216126+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/5E2J5HZ3IEBL2AOUGU4DATSK5H","json":"https://pith.science/pith/5E2J5HZ3IEBL2AOUGU4DATSK5H.json","graph_json":"https://pith.science/api/pith-number/5E2J5HZ3IEBL2AOUGU4DATSK5H/graph.json","events_json":"https://pith.science/api/pith-number/5E2J5HZ3IEBL2AOUGU4DATSK5H/events.json","paper":"https://pith.science/paper/5E2J5HZ3"},"agent_actions":{"view_html":"https://pith.science/pith/5E2J5HZ3IEBL2AOUGU4DATSK5H","download_json":"https://pith.science/pith/5E2J5HZ3IEBL2AOUGU4DATSK5H.json","view_paper":"https://pith.science/paper/5E2J5HZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.2571&json=true","fetch_graph":"https://pith.science/api/pith-number/5E2J5HZ3IEBL2AOUGU4DATSK5H/graph.json","fetch_events":"https://pith.science/api/pith-number/5E2J5HZ3IEBL2AOUGU4DATSK5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5E2J5HZ3IEBL2AOUGU4DATSK5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5E2J5HZ3IEBL2AOUGU4DATSK5H/action/storage_attestation","attest_author":"https://pith.science/pith/5E2J5HZ3IEBL2AOUGU4DATSK5H/action/author_attestation","sign_citation":"https://pith.science/pith/5E2J5HZ3IEBL2AOUGU4DATSK5H/action/citation_signature","submit_replication":"https://pith.science/pith/5E2J5HZ3IEBL2AOUGU4DATSK5H/action/replication_record"}},"created_at":"2026-05-18T02:25:34.134322+00:00","updated_at":"2026-05-18T02:25:34.134322+00:00"}