{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:U3KDBKME4N4KVHIYUEMC2VJWGE","short_pith_number":"pith:U3KDBKME","schema_version":"1.0","canonical_sha256":"a6d430a984e378aa9d18a1182d553631048375e6bc7499172f3697f794a39faf","source":{"kind":"arxiv","id":"1511.04472","version":1},"attestation_state":"computed","paper":{"title":"Solving Jigsaw Puzzles with Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chris Russell, Lourdes Agapito, Rui Yu","submitted_at":"2015-11-13T22:15:54Z","abstract_excerpt":"We propose a novel Linear Program (LP) based formula- tion for solving jigsaw puzzles. We formulate jigsaw solving as a set of successive global convex relaxations of the stan- dard NP-hard formulation, that can describe both jigsaws with pieces of unknown position and puzzles of unknown po- sition and orientation. The main contribution and strength of our approach comes from the LP assembly strategy. In contrast to existing greedy methods, our LP solver exploits all the pairwise matches simultaneously, and computes the position of each piece/component globally. The main ad- vantages of our LP"},"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":"1511.04472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-13T22:15:54Z","cross_cats_sorted":[],"title_canon_sha256":"34a309d5c2ba326b27f0539cb3e5c22646de470a64d57a4fd214b57cf70b0bbd","abstract_canon_sha256":"30512f9e9b25b41da33f6d689732a52e1797fa08d30193b968234723898f92f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:56.955484Z","signature_b64":"W2kTCy+HdXBqv7fpb6WcseZHLcwRhdvKJQR9ndAIHhKW9YqDS8ySuYX7o2Gso3BJcWelgEgjkZIy+xO5bWLMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6d430a984e378aa9d18a1182d553631048375e6bc7499172f3697f794a39faf","last_reissued_at":"2026-05-18T01:26:56.954983Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:56.954983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Jigsaw Puzzles with Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chris Russell, Lourdes Agapito, Rui Yu","submitted_at":"2015-11-13T22:15:54Z","abstract_excerpt":"We propose a novel Linear Program (LP) based formula- tion for solving jigsaw puzzles. We formulate jigsaw solving as a set of successive global convex relaxations of the stan- dard NP-hard formulation, that can describe both jigsaws with pieces of unknown position and puzzles of unknown po- sition and orientation. The main contribution and strength of our approach comes from the LP assembly strategy. In contrast to existing greedy methods, our LP solver exploits all the pairwise matches simultaneously, and computes the position of each piece/component globally. The main ad- vantages of our LP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04472","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":"1511.04472","created_at":"2026-05-18T01:26:56.955052+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.04472v1","created_at":"2026-05-18T01:26:56.955052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04472","created_at":"2026-05-18T01:26:56.955052+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3KDBKME4N4K","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3KDBKME4N4KVHIY","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3KDBKME","created_at":"2026-05-18T12:29:44.643036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2008.07644","citing_title":"Pictorial and apictorial polygonal jigsaw puzzles from arbitrary number of crossing cuts","ref_index":75,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12077","citing_title":"The Missing GAP: From Solving Square Jigsaw Puzzles to Handling Real World Archaeological Fragments","ref_index":64,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U3KDBKME4N4KVHIYUEMC2VJWGE","json":"https://pith.science/pith/U3KDBKME4N4KVHIYUEMC2VJWGE.json","graph_json":"https://pith.science/api/pith-number/U3KDBKME4N4KVHIYUEMC2VJWGE/graph.json","events_json":"https://pith.science/api/pith-number/U3KDBKME4N4KVHIYUEMC2VJWGE/events.json","paper":"https://pith.science/paper/U3KDBKME"},"agent_actions":{"view_html":"https://pith.science/pith/U3KDBKME4N4KVHIYUEMC2VJWGE","download_json":"https://pith.science/pith/U3KDBKME4N4KVHIYUEMC2VJWGE.json","view_paper":"https://pith.science/paper/U3KDBKME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.04472&json=true","fetch_graph":"https://pith.science/api/pith-number/U3KDBKME4N4KVHIYUEMC2VJWGE/graph.json","fetch_events":"https://pith.science/api/pith-number/U3KDBKME4N4KVHIYUEMC2VJWGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3KDBKME4N4KVHIYUEMC2VJWGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3KDBKME4N4KVHIYUEMC2VJWGE/action/storage_attestation","attest_author":"https://pith.science/pith/U3KDBKME4N4KVHIYUEMC2VJWGE/action/author_attestation","sign_citation":"https://pith.science/pith/U3KDBKME4N4KVHIYUEMC2VJWGE/action/citation_signature","submit_replication":"https://pith.science/pith/U3KDBKME4N4KVHIYUEMC2VJWGE/action/replication_record"}},"created_at":"2026-05-18T01:26:56.955052+00:00","updated_at":"2026-05-18T01:26:56.955052+00:00"}