{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5E2J5HZ3IEBL2AOUGU4DATSK5H","short_pith_number":"pith:5E2J5HZ3","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"},"canonical_sha256":"e9349e9f3b4102bd01d43538304e4ae9d76db959a58fb745eba2b571648187e0","source":{"kind":"arxiv","id":"1405.2571","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2571","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2571v4","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2571","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"5E2J5HZ3IEBL","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5E2J5HZ3IEBL2AOU","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5E2J5HZ3","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5E2J5HZ3IEBL2AOUGU4DATSK5H","target":"record","payload":{"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"},"canonical_sha256":"e9349e9f3b4102bd01d43538304e4ae9d76db959a58fb745eba2b571648187e0","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"},"source_kind":"arxiv","source_id":"1405.2571","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W1hO73NUwa0/epLPU11xBgAze7eHs5HSWAlfMx3wMUMwzTxr1k/9+YKVxIdd6zTcDFpTseRVJiPW8Oy6OCcMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:00:35.917602Z"},"content_sha256":"cc174b8952c86b926a41d685ca2890004ab831338ac294ea85e4ac9a44bad14d","schema_version":"1.0","event_id":"sha256:cc174b8952c86b926a41d685ca2890004ab831338ac294ea85e4ac9a44bad14d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5E2J5HZ3IEBL2AOUGU4DATSK5H","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0mLu9QQmcOYq8orU9/0gJJug2sSTNbAJ0Ux+0WmWanuJNeVhv+JKidoe2Qt8fH4W5x01C9HRzl07j0ej1A2ZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:00:35.918254Z"},"content_sha256":"b618070b10025fd2411f30ff69c17fc3fee57ad09eca77d7d1cbb886daa92977","schema_version":"1.0","event_id":"sha256:b618070b10025fd2411f30ff69c17fc3fee57ad09eca77d7d1cbb886daa92977"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5E2J5HZ3IEBL2AOUGU4DATSK5H/bundle.json","state_url":"https://pith.science/pith/5E2J5HZ3IEBL2AOUGU4DATSK5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5E2J5HZ3IEBL2AOUGU4DATSK5H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T15:00:35Z","links":{"resolver":"https://pith.science/pith/5E2J5HZ3IEBL2AOUGU4DATSK5H","bundle":"https://pith.science/pith/5E2J5HZ3IEBL2AOUGU4DATSK5H/bundle.json","state":"https://pith.science/pith/5E2J5HZ3IEBL2AOUGU4DATSK5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5E2J5HZ3IEBL2AOUGU4DATSK5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5E2J5HZ3IEBL2AOUGU4DATSK5H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"03b18d7e66fe67ef336b898c527f88dbbd08e8509e319fe70620b886f131fd5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-11T19:07:55Z","title_canon_sha256":"cc5a8c13eaaf78a5029dc47087aade294f1cac56d26773ec395b9932864d0107"},"schema_version":"1.0","source":{"id":"1405.2571","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2571","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2571v4","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2571","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"5E2J5HZ3IEBL","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5E2J5HZ3IEBL2AOU","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5E2J5HZ3","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:b618070b10025fd2411f30ff69c17fc3fee57ad09eca77d7d1cbb886daa92977","target":"graph","created_at":"2026-05-18T02:25:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Kazuya Haraguchi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-11T19:07:55Z","title":"An Efficient Local Search for Partial Latin Square Extension Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2571","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cc174b8952c86b926a41d685ca2890004ab831338ac294ea85e4ac9a44bad14d","target":"record","created_at":"2026-05-18T02:25:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"03b18d7e66fe67ef336b898c527f88dbbd08e8509e319fe70620b886f131fd5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-11T19:07:55Z","title_canon_sha256":"cc5a8c13eaaf78a5029dc47087aade294f1cac56d26773ec395b9932864d0107"},"schema_version":"1.0","source":{"id":"1405.2571","kind":"arxiv","version":4}},"canonical_sha256":"e9349e9f3b4102bd01d43538304e4ae9d76db959a58fb745eba2b571648187e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9349e9f3b4102bd01d43538304e4ae9d76db959a58fb745eba2b571648187e0","first_computed_at":"2026-05-18T02:25:34.134250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:34.134250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jD6PLXUjFot2rS9GmTIBphb2Md7b3aGDmIc7oSMLVURsfrjIjeXNZrhWyMcCSY0/SjckRagMx+qbb0SM+RJjCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:34.134694Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.2571","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc174b8952c86b926a41d685ca2890004ab831338ac294ea85e4ac9a44bad14d","sha256:b618070b10025fd2411f30ff69c17fc3fee57ad09eca77d7d1cbb886daa92977"],"state_sha256":"1ae1cd782de1bbc7953617d32c4075c1670c03c4347b53788e615d0b5d60ddd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AC0MDwfFbqgytAMuMLxkf/jCT1qr/CXKFgy3IJn1xd/S0BYO3o6bpUI+G41hqVLny2dVALb57DDD+F8M7Tp0DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:00:35.920232Z","bundle_sha256":"b967c5c42ae6802dba000961a93c535426ef2bb6030d24e28d2966f7a8bb800f"}}