{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:S4QCH2EFAKUSGRB5CYHLBTQWQJ","short_pith_number":"pith:S4QCH2EF","canonical_record":{"source":{"id":"1207.3340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-07-13T19:49:22Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"4ce188d63cfa3ce68c7b01b27122eb13043512b9753b4c20a049d76aa8ccc5f9","abstract_canon_sha256":"15363757a0fa84942f039e1206e45ccb3cd379ac986dbaf076a00b35c9508b26"},"schema_version":"1.0"},"canonical_sha256":"972023e88502a923443d160eb0ce168253aba7b9cfc46556be129da4f92366a5","source":{"kind":"arxiv","id":"1207.3340","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3340","created_at":"2026-05-18T01:56:23Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3340v1","created_at":"2026-05-18T01:56:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3340","created_at":"2026-05-18T01:56:23Z"},{"alias_kind":"pith_short_12","alias_value":"S4QCH2EFAKUS","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"S4QCH2EFAKUSGRB5","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"S4QCH2EF","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:S4QCH2EFAKUSGRB5CYHLBTQWQJ","target":"record","payload":{"canonical_record":{"source":{"id":"1207.3340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-07-13T19:49:22Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"4ce188d63cfa3ce68c7b01b27122eb13043512b9753b4c20a049d76aa8ccc5f9","abstract_canon_sha256":"15363757a0fa84942f039e1206e45ccb3cd379ac986dbaf076a00b35c9508b26"},"schema_version":"1.0"},"canonical_sha256":"972023e88502a923443d160eb0ce168253aba7b9cfc46556be129da4f92366a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:56:23.816828Z","signature_b64":"R+hUDXSYPuyaQ+/RBVSRU4GNI40OXbY7KxzVEwcXlon6WSVzmOgi5R855gT5vxDc1VNJpIR7HvD5VvUnFLEwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"972023e88502a923443d160eb0ce168253aba7b9cfc46556be129da4f92366a5","last_reissued_at":"2026-05-18T01:56:23.816282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:56:23.816282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.3340","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:56:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1u/NrXyMxTTdgAmpcdhBFmNiBxCptKfaAW8NgkngCb0/UF9Te2pQu//ibINhi2d8CWyiwhB9+1uIaUkbdnmzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:39:53.970646Z"},"content_sha256":"878149189b2ff91075cd53d55024fded18de5a5666c4de43b2ac06d2add1f99d","schema_version":"1.0","event_id":"sha256:878149189b2ff91075cd53d55024fded18de5a5666c4de43b2ac06d2add1f99d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:S4QCH2EFAKUSGRB5CYHLBTQWQJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The computation of generalized percolation critical polynomials by the deletion-contraction algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cond-mat.stat-mech","authors_text":"Christian R. Scullard","submitted_at":"2012-07-13T19:49:22Z","abstract_excerpt":"Although every exactly known bond percolation critical threshold is the root in $[0,1]$ of a lattice-dependent polynomial, it has recently been shown that the notion of a critical polynomial can be extended to any periodic lattice. The polynomial is computed on a finite subgraph, called the base, of an infinite lattice. For any problem with exactly known solution, the prediction of the bond threshold is always correct, regardless of the base chosen. For unsolved problems, the polynomial is referred to as the generalized critical polynomial and provides an approximation that becomes more accura"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3340","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:56:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"psHFQAplfZEk3uxOrZk4rk5wz7a8LX8kSAk0OKohhv5+e9lttLbQZOadxQMoYhIf436xrZcCo22a8p3KImsAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:39:53.971179Z"},"content_sha256":"e611c8608c6b7d51fe099161d89807f462ba27b6b6696b9809302c11c1e55a1b","schema_version":"1.0","event_id":"sha256:e611c8608c6b7d51fe099161d89807f462ba27b6b6696b9809302c11c1e55a1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4QCH2EFAKUSGRB5CYHLBTQWQJ/bundle.json","state_url":"https://pith.science/pith/S4QCH2EFAKUSGRB5CYHLBTQWQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4QCH2EFAKUSGRB5CYHLBTQWQJ/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-26T02:39:53Z","links":{"resolver":"https://pith.science/pith/S4QCH2EFAKUSGRB5CYHLBTQWQJ","bundle":"https://pith.science/pith/S4QCH2EFAKUSGRB5CYHLBTQWQJ/bundle.json","state":"https://pith.science/pith/S4QCH2EFAKUSGRB5CYHLBTQWQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4QCH2EFAKUSGRB5CYHLBTQWQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:S4QCH2EFAKUSGRB5CYHLBTQWQJ","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":"15363757a0fa84942f039e1206e45ccb3cd379ac986dbaf076a00b35c9508b26","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-07-13T19:49:22Z","title_canon_sha256":"4ce188d63cfa3ce68c7b01b27122eb13043512b9753b4c20a049d76aa8ccc5f9"},"schema_version":"1.0","source":{"id":"1207.3340","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3340","created_at":"2026-05-18T01:56:23Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3340v1","created_at":"2026-05-18T01:56:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3340","created_at":"2026-05-18T01:56:23Z"},{"alias_kind":"pith_short_12","alias_value":"S4QCH2EFAKUS","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"S4QCH2EFAKUSGRB5","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"S4QCH2EF","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:e611c8608c6b7d51fe099161d89807f462ba27b6b6696b9809302c11c1e55a1b","target":"graph","created_at":"2026-05-18T01:56:23Z","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":"Although every exactly known bond percolation critical threshold is the root in $[0,1]$ of a lattice-dependent polynomial, it has recently been shown that the notion of a critical polynomial can be extended to any periodic lattice. The polynomial is computed on a finite subgraph, called the base, of an infinite lattice. For any problem with exactly known solution, the prediction of the bond threshold is always correct, regardless of the base chosen. For unsolved problems, the polynomial is referred to as the generalized critical polynomial and provides an approximation that becomes more accura","authors_text":"Christian R. Scullard","cross_cats":["cond-mat.dis-nn"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-07-13T19:49:22Z","title":"The computation of generalized percolation critical polynomials by the deletion-contraction algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3340","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:878149189b2ff91075cd53d55024fded18de5a5666c4de43b2ac06d2add1f99d","target":"record","created_at":"2026-05-18T01:56:23Z","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":"15363757a0fa84942f039e1206e45ccb3cd379ac986dbaf076a00b35c9508b26","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-07-13T19:49:22Z","title_canon_sha256":"4ce188d63cfa3ce68c7b01b27122eb13043512b9753b4c20a049d76aa8ccc5f9"},"schema_version":"1.0","source":{"id":"1207.3340","kind":"arxiv","version":1}},"canonical_sha256":"972023e88502a923443d160eb0ce168253aba7b9cfc46556be129da4f92366a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"972023e88502a923443d160eb0ce168253aba7b9cfc46556be129da4f92366a5","first_computed_at":"2026-05-18T01:56:23.816282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:56:23.816282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R+hUDXSYPuyaQ+/RBVSRU4GNI40OXbY7KxzVEwcXlon6WSVzmOgi5R855gT5vxDc1VNJpIR7HvD5VvUnFLEwDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:56:23.816828Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3340","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:878149189b2ff91075cd53d55024fded18de5a5666c4de43b2ac06d2add1f99d","sha256:e611c8608c6b7d51fe099161d89807f462ba27b6b6696b9809302c11c1e55a1b"],"state_sha256":"27d8400faaf6141689c39b56ea4ab6d3d582f739a74d2d0bbb7862411d8c026f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sluY8gO+qMoYate/aycc+i70NsLaHnUenCstU4w1mYIRIptlU+ZhavXY72Kj1oo0c2X2+fDhnAdrSq5cjE/fCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T02:39:53.973987Z","bundle_sha256":"e882d18131045e45aabd9c6d6fe3401e4faddaeceb30ce9ade231c34f1641fcb"}}