{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DKTBTJJBK3DDE67FTJO3SVYSWF","short_pith_number":"pith:DKTBTJJB","schema_version":"1.0","canonical_sha256":"1aa619a52156c6327be59a5db95712b178ff48a41e9999e104e7b187da63fbbc","source":{"kind":"arxiv","id":"1605.03086","version":1},"attestation_state":"computed","paper":{"title":"Shotgun Assembly of Random Jigsaw Puzzles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"math.CO","authors_text":"Charles Bordenave, Elchanan Mossel, Uriel Feige","submitted_at":"2016-05-10T16:31:26Z","abstract_excerpt":"In a recent work, Mossel and Ross considered the shotgun assembly problem for a random jigsaw puzzle. Their model consists of a puzzle - an $n\\times n$ grid, where each vertex is viewed as a center of a piece. They assume that each of the four edges adjacent to a vertex, is assigned one of $q$ colors (corresponding to \"jigs\", or cut shapes) uniformly at random. Mossel and Ross asked: how large should $q = q(n)$ be so that with high probability the puzzle can be assembled uniquely given the collection of individual tiles? They showed that if $q = \\omega(n^2)$, then the puzzle can be assembled u"},"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":"1605.03086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-10T16:31:26Z","cross_cats_sorted":["cs.DS","math.PR"],"title_canon_sha256":"d079cf0aa76c1e2579cb7569abc45663ed86c9f7b3e5e9e810c25109cd6b112f","abstract_canon_sha256":"104b4ff4f755af8fc22b3db05bc64001439afc987d211096e3ea6027dcc87d59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:07.658049Z","signature_b64":"q6EM8ba68akWytT30RT3hrNC1cj6hdHY20W2rnwjDojZ9HnyLfIEpWZ6C7X8dJ2cHfBoDZRl9nP+T/PAR3fmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1aa619a52156c6327be59a5db95712b178ff48a41e9999e104e7b187da63fbbc","last_reissued_at":"2026-05-18T01:15:07.657416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:07.657416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shotgun Assembly of Random Jigsaw Puzzles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"math.CO","authors_text":"Charles Bordenave, Elchanan Mossel, Uriel Feige","submitted_at":"2016-05-10T16:31:26Z","abstract_excerpt":"In a recent work, Mossel and Ross considered the shotgun assembly problem for a random jigsaw puzzle. Their model consists of a puzzle - an $n\\times n$ grid, where each vertex is viewed as a center of a piece. They assume that each of the four edges adjacent to a vertex, is assigned one of $q$ colors (corresponding to \"jigs\", or cut shapes) uniformly at random. Mossel and Ross asked: how large should $q = q(n)$ be so that with high probability the puzzle can be assembled uniquely given the collection of individual tiles? They showed that if $q = \\omega(n^2)$, then the puzzle can be assembled u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03086","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":"1605.03086","created_at":"2026-05-18T01:15:07.657519+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03086v1","created_at":"2026-05-18T01:15:07.657519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03086","created_at":"2026-05-18T01:15:07.657519+00:00"},{"alias_kind":"pith_short_12","alias_value":"DKTBTJJBK3DD","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DKTBTJJBK3DDE67F","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DKTBTJJB","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.07250","citing_title":"Shotgun reconstruction in the hypercube","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DKTBTJJBK3DDE67FTJO3SVYSWF","json":"https://pith.science/pith/DKTBTJJBK3DDE67FTJO3SVYSWF.json","graph_json":"https://pith.science/api/pith-number/DKTBTJJBK3DDE67FTJO3SVYSWF/graph.json","events_json":"https://pith.science/api/pith-number/DKTBTJJBK3DDE67FTJO3SVYSWF/events.json","paper":"https://pith.science/paper/DKTBTJJB"},"agent_actions":{"view_html":"https://pith.science/pith/DKTBTJJBK3DDE67FTJO3SVYSWF","download_json":"https://pith.science/pith/DKTBTJJBK3DDE67FTJO3SVYSWF.json","view_paper":"https://pith.science/paper/DKTBTJJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03086&json=true","fetch_graph":"https://pith.science/api/pith-number/DKTBTJJBK3DDE67FTJO3SVYSWF/graph.json","fetch_events":"https://pith.science/api/pith-number/DKTBTJJBK3DDE67FTJO3SVYSWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DKTBTJJBK3DDE67FTJO3SVYSWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DKTBTJJBK3DDE67FTJO3SVYSWF/action/storage_attestation","attest_author":"https://pith.science/pith/DKTBTJJBK3DDE67FTJO3SVYSWF/action/author_attestation","sign_citation":"https://pith.science/pith/DKTBTJJBK3DDE67FTJO3SVYSWF/action/citation_signature","submit_replication":"https://pith.science/pith/DKTBTJJBK3DDE67FTJO3SVYSWF/action/replication_record"}},"created_at":"2026-05-18T01:15:07.657519+00:00","updated_at":"2026-05-18T01:15:07.657519+00:00"}