{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:Z3S2NOQYFXXGWRUQAWLDFM7GON","short_pith_number":"pith:Z3S2NOQY","schema_version":"1.0","canonical_sha256":"cee5a6ba182dee6b4690059632b3e6734d4675f27a12979728eef372e1d234b8","source":{"kind":"arxiv","id":"1209.1451","version":1},"attestation_state":"computed","paper":{"title":"Transfer matrix computation of generalised critical polynomials in percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Christian R. Scullard, Jesper Lykke Jacobsen","submitted_at":"2012-09-07T06:50:39Z","abstract_excerpt":"Percolation thresholds have recently been studied by means of a graph polynomial $P_B(p)$, henceforth referred to as the critical polynomial, that may be defined on any periodic lattice. The polynomial depends on a finite subgraph $B$, called the basis, and the way in which the basis is tiled to form the lattice. The unique root of $P_B(p)$ in $[0,1]$ either gives the exact percolation threshold for the lattice, or provides an approximation that becomes more accurate with appropriately increasing size of $B$. Initially $P_B(p)$ was defined by a contraction-deletion identity, similar to that sa"},"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":"1209.1451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-09-07T06:50:39Z","cross_cats_sorted":[],"title_canon_sha256":"9f2927c9978f8619f5fd554e7c752c1daec1ee18f3cd8bb113af6d5cabedc203","abstract_canon_sha256":"97e3971815b3cf9793ff090a03ec36e50091b67a2701c8134bf1f5ee7a329e86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:04.782671Z","signature_b64":"eRA7b44aYmGA/jJbatmo8Vg1FfQwDpjWK9jdufUDYwc5zXE6m4ehIO5wEFCCAo9Yzp6CpgMxE9jnUb8pr8CBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cee5a6ba182dee6b4690059632b3e6734d4675f27a12979728eef372e1d234b8","last_reissued_at":"2026-05-18T03:46:04.781547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:04.781547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transfer matrix computation of generalised critical polynomials in percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Christian R. Scullard, Jesper Lykke Jacobsen","submitted_at":"2012-09-07T06:50:39Z","abstract_excerpt":"Percolation thresholds have recently been studied by means of a graph polynomial $P_B(p)$, henceforth referred to as the critical polynomial, that may be defined on any periodic lattice. The polynomial depends on a finite subgraph $B$, called the basis, and the way in which the basis is tiled to form the lattice. The unique root of $P_B(p)$ in $[0,1]$ either gives the exact percolation threshold for the lattice, or provides an approximation that becomes more accurate with appropriately increasing size of $B$. Initially $P_B(p)$ was defined by a contraction-deletion identity, similar to that sa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1451","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":"1209.1451","created_at":"2026-05-18T03:46:04.781699+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.1451v1","created_at":"2026-05-18T03:46:04.781699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1451","created_at":"2026-05-18T03:46:04.781699+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3S2NOQYFXXG","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3S2NOQYFXXGWRUQ","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3S2NOQY","created_at":"2026-05-18T12:27:30.460161+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/Z3S2NOQYFXXGWRUQAWLDFM7GON","json":"https://pith.science/pith/Z3S2NOQYFXXGWRUQAWLDFM7GON.json","graph_json":"https://pith.science/api/pith-number/Z3S2NOQYFXXGWRUQAWLDFM7GON/graph.json","events_json":"https://pith.science/api/pith-number/Z3S2NOQYFXXGWRUQAWLDFM7GON/events.json","paper":"https://pith.science/paper/Z3S2NOQY"},"agent_actions":{"view_html":"https://pith.science/pith/Z3S2NOQYFXXGWRUQAWLDFM7GON","download_json":"https://pith.science/pith/Z3S2NOQYFXXGWRUQAWLDFM7GON.json","view_paper":"https://pith.science/paper/Z3S2NOQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.1451&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3S2NOQYFXXGWRUQAWLDFM7GON/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3S2NOQYFXXGWRUQAWLDFM7GON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3S2NOQYFXXGWRUQAWLDFM7GON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3S2NOQYFXXGWRUQAWLDFM7GON/action/storage_attestation","attest_author":"https://pith.science/pith/Z3S2NOQYFXXGWRUQAWLDFM7GON/action/author_attestation","sign_citation":"https://pith.science/pith/Z3S2NOQYFXXGWRUQAWLDFM7GON/action/citation_signature","submit_replication":"https://pith.science/pith/Z3S2NOQYFXXGWRUQAWLDFM7GON/action/replication_record"}},"created_at":"2026-05-18T03:46:04.781699+00:00","updated_at":"2026-05-18T03:46:04.781699+00:00"}