{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:B74A2F4ROQRGFNOOUCAUCLAEY4","short_pith_number":"pith:B74A2F4R","schema_version":"1.0","canonical_sha256":"0ff80d1791742262b5cea081412c04c7303e31e296c32dfa328683a447189092","source":{"kind":"arxiv","id":"1310.2194","version":3},"attestation_state":"computed","paper":{"title":"Nucleation scaling in jigsaw percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"David Sivakoff, Janko Gravner","submitted_at":"2013-10-08T16:47:27Z","abstract_excerpt":"Jigsaw percolation is a nonlocal process that iteratively merges connected clusters in a deterministic \"puzzle graph\" by using connectivity properties of a random \"people graph\" on the same set of vertices. We presume the Erdos--Renyi people graph with edge probability p and investigate the probability that the puzzle is solved, that is, that the process eventually produces a single cluster. In some generality, for puzzle graphs with N vertices of degrees about D (in the appropriate sense), this probability is close to 1 or small depending on whether pD(log N) is large or small. The one dimens"},"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":"1310.2194","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-10-08T16:47:27Z","cross_cats_sorted":[],"title_canon_sha256":"f1f727ae010cc64fc5cf06a59d583b094a325dcd8b74962c504a82afc2b67388","abstract_canon_sha256":"542421fede1790373abeb3d0d0dee842b5693dae67d0c2f5185ae76d71d15c7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:09.326842Z","signature_b64":"yrONPELVlCP0xE7c8CHhHK3NLMsvor3Qquh9hucDrxmYH5sSP7i5cf0c8GiLeHTIjkhHceBHmczquolFG+HkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ff80d1791742262b5cea081412c04c7303e31e296c32dfa328683a447189092","last_reissued_at":"2026-05-18T02:43:09.326345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:09.326345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nucleation scaling in jigsaw percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"David Sivakoff, Janko Gravner","submitted_at":"2013-10-08T16:47:27Z","abstract_excerpt":"Jigsaw percolation is a nonlocal process that iteratively merges connected clusters in a deterministic \"puzzle graph\" by using connectivity properties of a random \"people graph\" on the same set of vertices. We presume the Erdos--Renyi people graph with edge probability p and investigate the probability that the puzzle is solved, that is, that the process eventually produces a single cluster. In some generality, for puzzle graphs with N vertices of degrees about D (in the appropriate sense), this probability is close to 1 or small depending on whether pD(log N) is large or small. The one dimens"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2194","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.2194","created_at":"2026-05-18T02:43:09.326418+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2194v3","created_at":"2026-05-18T02:43:09.326418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2194","created_at":"2026-05-18T02:43:09.326418+00:00"},{"alias_kind":"pith_short_12","alias_value":"B74A2F4ROQRG","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"B74A2F4ROQRGFNOO","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"B74A2F4R","created_at":"2026-05-18T12:27:38.830355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B74A2F4ROQRGFNOOUCAUCLAEY4","json":"https://pith.science/pith/B74A2F4ROQRGFNOOUCAUCLAEY4.json","graph_json":"https://pith.science/api/pith-number/B74A2F4ROQRGFNOOUCAUCLAEY4/graph.json","events_json":"https://pith.science/api/pith-number/B74A2F4ROQRGFNOOUCAUCLAEY4/events.json","paper":"https://pith.science/paper/B74A2F4R"},"agent_actions":{"view_html":"https://pith.science/pith/B74A2F4ROQRGFNOOUCAUCLAEY4","download_json":"https://pith.science/pith/B74A2F4ROQRGFNOOUCAUCLAEY4.json","view_paper":"https://pith.science/paper/B74A2F4R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2194&json=true","fetch_graph":"https://pith.science/api/pith-number/B74A2F4ROQRGFNOOUCAUCLAEY4/graph.json","fetch_events":"https://pith.science/api/pith-number/B74A2F4ROQRGFNOOUCAUCLAEY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B74A2F4ROQRGFNOOUCAUCLAEY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B74A2F4ROQRGFNOOUCAUCLAEY4/action/storage_attestation","attest_author":"https://pith.science/pith/B74A2F4ROQRGFNOOUCAUCLAEY4/action/author_attestation","sign_citation":"https://pith.science/pith/B74A2F4ROQRGFNOOUCAUCLAEY4/action/citation_signature","submit_replication":"https://pith.science/pith/B74A2F4ROQRGFNOOUCAUCLAEY4/action/replication_record"}},"created_at":"2026-05-18T02:43:09.326418+00:00","updated_at":"2026-05-18T02:43:09.326418+00:00"}