{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NPC3OPVU4QYLRB5WVHEBZ7ALW5","short_pith_number":"pith:NPC3OPVU","canonical_record":{"source":{"id":"1111.5877","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2011-11-25T01:09:34Z","cross_cats_sorted":["cond-mat.stat-mech","math.CO","math.MP"],"title_canon_sha256":"0e8141935b8043814525e26c71a1fa036b9ea6693091a76237c99b72b95c1717","abstract_canon_sha256":"54bff41182d32c7ccd0a06baafe7fff93f9d2074f76af9f4c4e17f659f01021a"},"schema_version":"1.0"},"canonical_sha256":"6bc5b73eb4e430b887b6a9c81cfc0bb76bfd0a63a96b3a5426deaaca5debdd76","source":{"kind":"arxiv","id":"1111.5877","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5877","created_at":"2026-05-18T01:59:25Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5877v1","created_at":"2026-05-18T01:59:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5877","created_at":"2026-05-18T01:59:25Z"},{"alias_kind":"pith_short_12","alias_value":"NPC3OPVU4QYL","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NPC3OPVU4QYLRB5W","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NPC3OPVU","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NPC3OPVU4QYLRB5WVHEBZ7ALW5","target":"record","payload":{"canonical_record":{"source":{"id":"1111.5877","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2011-11-25T01:09:34Z","cross_cats_sorted":["cond-mat.stat-mech","math.CO","math.MP"],"title_canon_sha256":"0e8141935b8043814525e26c71a1fa036b9ea6693091a76237c99b72b95c1717","abstract_canon_sha256":"54bff41182d32c7ccd0a06baafe7fff93f9d2074f76af9f4c4e17f659f01021a"},"schema_version":"1.0"},"canonical_sha256":"6bc5b73eb4e430b887b6a9c81cfc0bb76bfd0a63a96b3a5426deaaca5debdd76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:25.591836Z","signature_b64":"9JLjL4SCT3ZMqdldKnBz7pBF3ep9sU695uNzWdGHeQTnzfR4KtyM3+Hg8T2AXrtKIKCrcnQKjlsJukYn6sHECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bc5b73eb4e430b887b6a9c81cfc0bb76bfd0a63a96b3a5426deaaca5debdd76","last_reissued_at":"2026-05-18T01:59:25.591363Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:25.591363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.5877","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:59:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GFsBnJ8oD8zRhtJLPPkiCOk1TXbq3d76joUlsu4YE3F3I/VirIJyp56acWFHcEY3kwANGhogQy3+TWobdVvPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:03:28.682274Z"},"content_sha256":"15f8a7737bd5638cb56142ab949ed0cac8d64cf83c40c72d835b200f8d6ca238","schema_version":"1.0","event_id":"sha256:15f8a7737bd5638cb56142ab949ed0cac8d64cf83c40c72d835b200f8d6ca238"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NPC3OPVU4QYLRB5WVHEBZ7ALW5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new transfer-matrix algorithm for exact enumerations: Self-avoiding polygons on the square lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.CO","math.MP"],"primary_cat":"math-ph","authors_text":"Iwan Jensen, Nathan Clisby","submitted_at":"2011-11-25T01:09:34Z","abstract_excerpt":"We present a new and more efficient implementation of transfer-matrix methods for exact enumerations of lattice objects. The new method is illustrated by an application to the enumeration of self-avoiding polygons on the square lattice. A detailed comparison with the previous best algorithm shows significant improvement in the running time of the algorithm. The new algorithm is used to extend the enumeration of polygons to length 130 from the previous record of 110."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5877","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:59:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ogZlAr3j9xQZCNswekMOAkSl9oBse6g9X0RInzn+fyEBytV2Ah7/DjOlZ7kY2IoUrbAkcIe6XDrq2QpY5mqSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:03:28.682720Z"},"content_sha256":"9cc0d3d5d6896e2dcf71ace42f8f4e7a0f86b75cb158ef5cd0bf971837699a5b","schema_version":"1.0","event_id":"sha256:9cc0d3d5d6896e2dcf71ace42f8f4e7a0f86b75cb158ef5cd0bf971837699a5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NPC3OPVU4QYLRB5WVHEBZ7ALW5/bundle.json","state_url":"https://pith.science/pith/NPC3OPVU4QYLRB5WVHEBZ7ALW5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NPC3OPVU4QYLRB5WVHEBZ7ALW5/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-24T06:03:28Z","links":{"resolver":"https://pith.science/pith/NPC3OPVU4QYLRB5WVHEBZ7ALW5","bundle":"https://pith.science/pith/NPC3OPVU4QYLRB5WVHEBZ7ALW5/bundle.json","state":"https://pith.science/pith/NPC3OPVU4QYLRB5WVHEBZ7ALW5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NPC3OPVU4QYLRB5WVHEBZ7ALW5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NPC3OPVU4QYLRB5WVHEBZ7ALW5","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":"54bff41182d32c7ccd0a06baafe7fff93f9d2074f76af9f4c4e17f659f01021a","cross_cats_sorted":["cond-mat.stat-mech","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2011-11-25T01:09:34Z","title_canon_sha256":"0e8141935b8043814525e26c71a1fa036b9ea6693091a76237c99b72b95c1717"},"schema_version":"1.0","source":{"id":"1111.5877","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5877","created_at":"2026-05-18T01:59:25Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5877v1","created_at":"2026-05-18T01:59:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5877","created_at":"2026-05-18T01:59:25Z"},{"alias_kind":"pith_short_12","alias_value":"NPC3OPVU4QYL","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NPC3OPVU4QYLRB5W","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NPC3OPVU","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:9cc0d3d5d6896e2dcf71ace42f8f4e7a0f86b75cb158ef5cd0bf971837699a5b","target":"graph","created_at":"2026-05-18T01:59:25Z","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":"We present a new and more efficient implementation of transfer-matrix methods for exact enumerations of lattice objects. The new method is illustrated by an application to the enumeration of self-avoiding polygons on the square lattice. A detailed comparison with the previous best algorithm shows significant improvement in the running time of the algorithm. The new algorithm is used to extend the enumeration of polygons to length 130 from the previous record of 110.","authors_text":"Iwan Jensen, Nathan Clisby","cross_cats":["cond-mat.stat-mech","math.CO","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2011-11-25T01:09:34Z","title":"A new transfer-matrix algorithm for exact enumerations: Self-avoiding polygons on the square lattice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5877","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:15f8a7737bd5638cb56142ab949ed0cac8d64cf83c40c72d835b200f8d6ca238","target":"record","created_at":"2026-05-18T01:59:25Z","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":"54bff41182d32c7ccd0a06baafe7fff93f9d2074f76af9f4c4e17f659f01021a","cross_cats_sorted":["cond-mat.stat-mech","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2011-11-25T01:09:34Z","title_canon_sha256":"0e8141935b8043814525e26c71a1fa036b9ea6693091a76237c99b72b95c1717"},"schema_version":"1.0","source":{"id":"1111.5877","kind":"arxiv","version":1}},"canonical_sha256":"6bc5b73eb4e430b887b6a9c81cfc0bb76bfd0a63a96b3a5426deaaca5debdd76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bc5b73eb4e430b887b6a9c81cfc0bb76bfd0a63a96b3a5426deaaca5debdd76","first_computed_at":"2026-05-18T01:59:25.591363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:25.591363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9JLjL4SCT3ZMqdldKnBz7pBF3ep9sU695uNzWdGHeQTnzfR4KtyM3+Hg8T2AXrtKIKCrcnQKjlsJukYn6sHECg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:25.591836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.5877","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15f8a7737bd5638cb56142ab949ed0cac8d64cf83c40c72d835b200f8d6ca238","sha256:9cc0d3d5d6896e2dcf71ace42f8f4e7a0f86b75cb158ef5cd0bf971837699a5b"],"state_sha256":"336a80d41fab5f2a5b4c444316b5b25b08ed985a2b714416717a64367d9f2ae2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d56uGbyu2lvSUOj/XfJ4Wf72HUn8DxvTbtuoBOgt2Q8CSwmkOmuj5kGmvy87HolA8t9J6XRuhjkSTF9PPZcWDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:03:28.685439Z","bundle_sha256":"43d5b029b5d3d0b60909a90e2abe63e233874fbe202328775a4fa4e5e17b6830"}}