{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DKTBTJJBK3DDE67FTJO3SVYSWF","short_pith_number":"pith:DKTBTJJB","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"},"canonical_sha256":"1aa619a52156c6327be59a5db95712b178ff48a41e9999e104e7b187da63fbbc","source":{"kind":"arxiv","id":"1605.03086","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03086","created_at":"2026-05-18T01:15:07Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03086v1","created_at":"2026-05-18T01:15:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03086","created_at":"2026-05-18T01:15:07Z"},{"alias_kind":"pith_short_12","alias_value":"DKTBTJJBK3DD","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DKTBTJJBK3DDE67F","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DKTBTJJB","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DKTBTJJBK3DDE67FTJO3SVYSWF","target":"record","payload":{"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"},"canonical_sha256":"1aa619a52156c6327be59a5db95712b178ff48a41e9999e104e7b187da63fbbc","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"},"source_kind":"arxiv","source_id":"1605.03086","source_version":1,"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-18T01:15:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fJ7m0lYnvntLXGlle1TH+fcpdFPZQ7L36JLWVz4BJ15Kk2ox303Myq+l9iigUBubj4Vg3WnR6vHXAZr+3W5/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:23:58.250665Z"},"content_sha256":"af26a1faf9c37f0144bf97d6b393da2164d298baf441dd4a6b7f0f01c87fc484","schema_version":"1.0","event_id":"sha256:af26a1faf9c37f0144bf97d6b393da2164d298baf441dd4a6b7f0f01c87fc484"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DKTBTJJBK3DDE67FTJO3SVYSWF","target":"graph","payload":{"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"},"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-18T01:15:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"smxBLo14X/Ybvl9d74Obbvqk6BIg5jIawmstxAktnlMj1ldsKi6cgIvF0yKf+Gy5Y6z7uv4LAcHWYj5XnzOgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:23:58.251339Z"},"content_sha256":"8b63c7ee412b42884fb5ef1ba8ef89b0cf8511b7b4deef94c1575fc848b994a8","schema_version":"1.0","event_id":"sha256:8b63c7ee412b42884fb5ef1ba8ef89b0cf8511b7b4deef94c1575fc848b994a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DKTBTJJBK3DDE67FTJO3SVYSWF/bundle.json","state_url":"https://pith.science/pith/DKTBTJJBK3DDE67FTJO3SVYSWF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DKTBTJJBK3DDE67FTJO3SVYSWF/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-05-27T19:23:58Z","links":{"resolver":"https://pith.science/pith/DKTBTJJBK3DDE67FTJO3SVYSWF","bundle":"https://pith.science/pith/DKTBTJJBK3DDE67FTJO3SVYSWF/bundle.json","state":"https://pith.science/pith/DKTBTJJBK3DDE67FTJO3SVYSWF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DKTBTJJBK3DDE67FTJO3SVYSWF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DKTBTJJBK3DDE67FTJO3SVYSWF","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":"104b4ff4f755af8fc22b3db05bc64001439afc987d211096e3ea6027dcc87d59","cross_cats_sorted":["cs.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-10T16:31:26Z","title_canon_sha256":"d079cf0aa76c1e2579cb7569abc45663ed86c9f7b3e5e9e810c25109cd6b112f"},"schema_version":"1.0","source":{"id":"1605.03086","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03086","created_at":"2026-05-18T01:15:07Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03086v1","created_at":"2026-05-18T01:15:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03086","created_at":"2026-05-18T01:15:07Z"},{"alias_kind":"pith_short_12","alias_value":"DKTBTJJBK3DD","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DKTBTJJBK3DDE67F","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DKTBTJJB","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:8b63c7ee412b42884fb5ef1ba8ef89b0cf8511b7b4deef94c1575fc848b994a8","target":"graph","created_at":"2026-05-18T01:15:07Z","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":"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","authors_text":"Charles Bordenave, Elchanan Mossel, Uriel Feige","cross_cats":["cs.DS","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-10T16:31:26Z","title":"Shotgun Assembly of Random Jigsaw Puzzles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03086","kind":"arxiv","version":1},"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:af26a1faf9c37f0144bf97d6b393da2164d298baf441dd4a6b7f0f01c87fc484","target":"record","created_at":"2026-05-18T01:15:07Z","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":"104b4ff4f755af8fc22b3db05bc64001439afc987d211096e3ea6027dcc87d59","cross_cats_sorted":["cs.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-10T16:31:26Z","title_canon_sha256":"d079cf0aa76c1e2579cb7569abc45663ed86c9f7b3e5e9e810c25109cd6b112f"},"schema_version":"1.0","source":{"id":"1605.03086","kind":"arxiv","version":1}},"canonical_sha256":"1aa619a52156c6327be59a5db95712b178ff48a41e9999e104e7b187da63fbbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1aa619a52156c6327be59a5db95712b178ff48a41e9999e104e7b187da63fbbc","first_computed_at":"2026-05-18T01:15:07.657416Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:07.657416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q6EM8ba68akWytT30RT3hrNC1cj6hdHY20W2rnwjDojZ9HnyLfIEpWZ6C7X8dJ2cHfBoDZRl9nP+T/PAR3fmCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:07.658049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03086","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af26a1faf9c37f0144bf97d6b393da2164d298baf441dd4a6b7f0f01c87fc484","sha256:8b63c7ee412b42884fb5ef1ba8ef89b0cf8511b7b4deef94c1575fc848b994a8"],"state_sha256":"69a145f9a02d9f9050d0940ae51d6d3ad7bf17c644125eb68e4ac758168350c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omMlqtPKdm/LDdfEm8lfhM64BiFEkK8R0QHYdTyMUEQ6zEc58GfX7mm8hcYUlvt8kF5GHNn4d6PcGGYustOvCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:23:58.254010Z","bundle_sha256":"2aac4fd652c3278ac689a162cacc8a80c81375da68f8222736426cc9c91d0f79"}}