{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:S6CESG45L2AWIJWXQKABSNJF2W","short_pith_number":"pith:S6CESG45","canonical_record":{"source":{"id":"1203.2295","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-11T00:12:05Z","cross_cats_sorted":["cs.DS","stat.CO"],"title_canon_sha256":"be30a044432093dfd29dc1855699cd529a77224c43bfa1d7b96147ee55b17b04","abstract_canon_sha256":"3974f3f742348e4aaf1a2b8833a771b940b51f28bb4ceb224791763ac1a4973a"},"schema_version":"1.0"},"canonical_sha256":"9784491b9d5e816426d78280193525d5b1e977b88a962613e5086f5baca918f1","source":{"kind":"arxiv","id":"1203.2295","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2295","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2295v3","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2295","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"pith_short_12","alias_value":"S6CESG45L2AW","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"S6CESG45L2AWIJWX","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"S6CESG45","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:S6CESG45L2AWIJWXQKABSNJF2W","target":"record","payload":{"canonical_record":{"source":{"id":"1203.2295","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-11T00:12:05Z","cross_cats_sorted":["cs.DS","stat.CO"],"title_canon_sha256":"be30a044432093dfd29dc1855699cd529a77224c43bfa1d7b96147ee55b17b04","abstract_canon_sha256":"3974f3f742348e4aaf1a2b8833a771b940b51f28bb4ceb224791763ac1a4973a"},"schema_version":"1.0"},"canonical_sha256":"9784491b9d5e816426d78280193525d5b1e977b88a962613e5086f5baca918f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:35.168070Z","signature_b64":"3Li2ekWlXWlkBPM7W1TE0qDaD5HXnM7J4/MWD7KzoQoGvXYBD2SNBEH7cIx9BFZkz0AIKmAhoZAGZWmtmhJdCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9784491b9d5e816426d78280193525d5b1e977b88a962613e5086f5baca918f1","last_reissued_at":"2026-05-18T03:25:35.167383Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:35.167383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.2295","source_version":3,"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-18T03:25:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nkn2fZrjsgWaq76EPEstW/nzK7pacQnYkRTSrGigwjCYlVjnuGK9JL4FrzP50aaLAnnYAU95+yciJ9LjVDP2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:55:47.086988Z"},"content_sha256":"a05033866be92b50d77e4ebe9a4fab3793c94d39abbadee77362b9fca38c60b7","schema_version":"1.0","event_id":"sha256:a05033866be92b50d77e4ebe9a4fab3793c94d39abbadee77362b9fca38c60b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:S6CESG45L2AWIJWXQKABSNJF2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Techniques for Solving Sudoku Puzzles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.CO"],"primary_cat":"math.OC","authors_text":"Eric C. Chi, Kenneth Lange","submitted_at":"2012-03-11T00:12:05Z","abstract_excerpt":"Solving Sudoku puzzles is one of the most popular pastimes in the world. Puzzles range in difficulty from easy to very challenging; the hardest puzzles tend to have the most empty cells. The current paper explains and compares three algorithms for solving Sudoku puzzles. Backtracking, simulated annealing, and alternating projections are generic methods for attacking combinatorial optimization problems. Our results favor backtracking. It infallibly solves a Sudoku puzzle or deduces that a unique solution does not exist. However, backtracking does not scale well in high-dimensional combinatorial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2295","kind":"arxiv","version":3},"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-18T03:25:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wyrj1Fx1EUYBUN9QkP5lOV/K3d592VqwVcvP9216GYAKdPlRGeOBkfazZaqKwlqlzjB9fx/9Hqa6c6KV0hreDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:55:47.087351Z"},"content_sha256":"663a4cab88d833e57587063e9ce94b0309f4b6143ae93c2d49e6fbd3c1e4f5d7","schema_version":"1.0","event_id":"sha256:663a4cab88d833e57587063e9ce94b0309f4b6143ae93c2d49e6fbd3c1e4f5d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6CESG45L2AWIJWXQKABSNJF2W/bundle.json","state_url":"https://pith.science/pith/S6CESG45L2AWIJWXQKABSNJF2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6CESG45L2AWIJWXQKABSNJF2W/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-01T15:55:47Z","links":{"resolver":"https://pith.science/pith/S6CESG45L2AWIJWXQKABSNJF2W","bundle":"https://pith.science/pith/S6CESG45L2AWIJWXQKABSNJF2W/bundle.json","state":"https://pith.science/pith/S6CESG45L2AWIJWXQKABSNJF2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6CESG45L2AWIJWXQKABSNJF2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:S6CESG45L2AWIJWXQKABSNJF2W","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":"3974f3f742348e4aaf1a2b8833a771b940b51f28bb4ceb224791763ac1a4973a","cross_cats_sorted":["cs.DS","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-11T00:12:05Z","title_canon_sha256":"be30a044432093dfd29dc1855699cd529a77224c43bfa1d7b96147ee55b17b04"},"schema_version":"1.0","source":{"id":"1203.2295","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2295","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2295v3","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2295","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"pith_short_12","alias_value":"S6CESG45L2AW","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"S6CESG45L2AWIJWX","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"S6CESG45","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:663a4cab88d833e57587063e9ce94b0309f4b6143ae93c2d49e6fbd3c1e4f5d7","target":"graph","created_at":"2026-05-18T03:25:35Z","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":"Solving Sudoku puzzles is one of the most popular pastimes in the world. Puzzles range in difficulty from easy to very challenging; the hardest puzzles tend to have the most empty cells. The current paper explains and compares three algorithms for solving Sudoku puzzles. Backtracking, simulated annealing, and alternating projections are generic methods for attacking combinatorial optimization problems. Our results favor backtracking. It infallibly solves a Sudoku puzzle or deduces that a unique solution does not exist. However, backtracking does not scale well in high-dimensional combinatorial","authors_text":"Eric C. Chi, Kenneth Lange","cross_cats":["cs.DS","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-11T00:12:05Z","title":"Techniques for Solving Sudoku Puzzles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2295","kind":"arxiv","version":3},"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:a05033866be92b50d77e4ebe9a4fab3793c94d39abbadee77362b9fca38c60b7","target":"record","created_at":"2026-05-18T03:25:35Z","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":"3974f3f742348e4aaf1a2b8833a771b940b51f28bb4ceb224791763ac1a4973a","cross_cats_sorted":["cs.DS","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-11T00:12:05Z","title_canon_sha256":"be30a044432093dfd29dc1855699cd529a77224c43bfa1d7b96147ee55b17b04"},"schema_version":"1.0","source":{"id":"1203.2295","kind":"arxiv","version":3}},"canonical_sha256":"9784491b9d5e816426d78280193525d5b1e977b88a962613e5086f5baca918f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9784491b9d5e816426d78280193525d5b1e977b88a962613e5086f5baca918f1","first_computed_at":"2026-05-18T03:25:35.167383Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:35.167383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Li2ekWlXWlkBPM7W1TE0qDaD5HXnM7J4/MWD7KzoQoGvXYBD2SNBEH7cIx9BFZkz0AIKmAhoZAGZWmtmhJdCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:35.168070Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.2295","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a05033866be92b50d77e4ebe9a4fab3793c94d39abbadee77362b9fca38c60b7","sha256:663a4cab88d833e57587063e9ce94b0309f4b6143ae93c2d49e6fbd3c1e4f5d7"],"state_sha256":"4ba51e1038a44a9d58d6cac027a0c4fb5eb73be58092b043ac6d1d381ddcabf2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2gKk1Wb4Eqj9tLWPtPPfDM1AM3xWjBeu/RvOhwnbGvTfo3YA7S57eTMH7SLLY4EGvOEVF6YLUrP/y2piFbyQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:55:47.089343Z","bundle_sha256":"299eb85a4290a4da108f1012e6fc438644f0559c74409ffa10a80bfc7f83db86"}}