{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:A6JFRRIKIOXOVQVNFJWJMLV24X","short_pith_number":"pith:A6JFRRIK","canonical_record":{"source":{"id":"1808.09032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-27T20:43:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8b2e89bbb141c29b13a35fef13d32525cb8f94a891736198d0e98bd3a29321d5","abstract_canon_sha256":"cbee08b2b5c4eefe5e9ca90e2bfdf2af20151b84bf62694ccc8eaa1b691da395"},"schema_version":"1.0"},"canonical_sha256":"079258c50a43aeeac2ad2a6c962ebae5e20fcc1208c7a5310755a951254e7f03","source":{"kind":"arxiv","id":"1808.09032","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09032","created_at":"2026-05-18T00:07:04Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09032v1","created_at":"2026-05-18T00:07:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09032","created_at":"2026-05-18T00:07:04Z"},{"alias_kind":"pith_short_12","alias_value":"A6JFRRIKIOXO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A6JFRRIKIOXOVQVN","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A6JFRRIK","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:A6JFRRIKIOXOVQVNFJWJMLV24X","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-27T20:43:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8b2e89bbb141c29b13a35fef13d32525cb8f94a891736198d0e98bd3a29321d5","abstract_canon_sha256":"cbee08b2b5c4eefe5e9ca90e2bfdf2af20151b84bf62694ccc8eaa1b691da395"},"schema_version":"1.0"},"canonical_sha256":"079258c50a43aeeac2ad2a6c962ebae5e20fcc1208c7a5310755a951254e7f03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:04.799221Z","signature_b64":"xgydfrEizrMfV5/HCVDmsgGgt9FsX8CQwhBBA0FZg4ET+t1EvlH2tesmscwHka1O342Yg8UpHkM8kJXVoJOnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"079258c50a43aeeac2ad2a6c962ebae5e20fcc1208c7a5310755a951254e7f03","last_reissued_at":"2026-05-18T00:07:04.798582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:04.798582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09032","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-18T00:07:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fRrmEk4+GRhgCE810DuGYiiWcRfUtZWqK4YU9aqs+oB+wYzv9sszOHZsVnNRNuoO4vLZ8R67mrQZAddz3f5ECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:04:09.997273Z"},"content_sha256":"bf50facc24de2c4b4d572315424a83226e51fb0f312130acec14d8cd410dd7aa","schema_version":"1.0","event_id":"sha256:bf50facc24de2c4b4d572315424a83226e51fb0f312130acec14d8cd410dd7aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:A6JFRRIKIOXOVQVNFJWJMLV24X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An upper bound on the number of self-avoiding polygons via joining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Alan Hammond","submitted_at":"2018-08-27T20:43:29Z","abstract_excerpt":"For $d \\geq 2$ and $n \\in \\mathbb{N}$ even, let $p_n = p_n(d)$ denote the number of length $n$ self-avoiding polygons in $\\mathbb{Z}^d$ up to translation. The polygon cardinality grows exponentially, and the growth rate $\\lim_{n \\in 2\\mathbb{N}} p_n^{1/n} \\in (0,\\infty)$ is called the connective constant and denoted by $\\mu$. Madras [J. Statist. Phys. 78 (1995) no. 3--4, 681--699] has shown that $p_n \\mu^{-n} \\leq C n^{-1/2}$ in dimension $d=2$. Here we establish that $p_n \\mu^{-n} \\leq n^{-3/2 + o(1)}$ for a set of even $n$ of full density when $d=2$. We also consider a certain variant of sel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09032","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-18T00:07:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TtHCtIS6Bpb2rCcMlOSlsHrPh+K0d/78D56U163b3hlu/eQAQpCbWX6VzFxKQYE4VWtk1A5pKdp2V2jxoP/pBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:04:09.997628Z"},"content_sha256":"036d189183a31dc4f50de61e3384d7e83889baecf8887170040f1a6bdde0f4f5","schema_version":"1.0","event_id":"sha256:036d189183a31dc4f50de61e3384d7e83889baecf8887170040f1a6bdde0f4f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6JFRRIKIOXOVQVNFJWJMLV24X/bundle.json","state_url":"https://pith.science/pith/A6JFRRIKIOXOVQVNFJWJMLV24X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6JFRRIKIOXOVQVNFJWJMLV24X/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-20T03:04:09Z","links":{"resolver":"https://pith.science/pith/A6JFRRIKIOXOVQVNFJWJMLV24X","bundle":"https://pith.science/pith/A6JFRRIKIOXOVQVNFJWJMLV24X/bundle.json","state":"https://pith.science/pith/A6JFRRIKIOXOVQVNFJWJMLV24X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6JFRRIKIOXOVQVNFJWJMLV24X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:A6JFRRIKIOXOVQVNFJWJMLV24X","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":"cbee08b2b5c4eefe5e9ca90e2bfdf2af20151b84bf62694ccc8eaa1b691da395","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-27T20:43:29Z","title_canon_sha256":"8b2e89bbb141c29b13a35fef13d32525cb8f94a891736198d0e98bd3a29321d5"},"schema_version":"1.0","source":{"id":"1808.09032","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09032","created_at":"2026-05-18T00:07:04Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09032v1","created_at":"2026-05-18T00:07:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09032","created_at":"2026-05-18T00:07:04Z"},{"alias_kind":"pith_short_12","alias_value":"A6JFRRIKIOXO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A6JFRRIKIOXOVQVN","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A6JFRRIK","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:036d189183a31dc4f50de61e3384d7e83889baecf8887170040f1a6bdde0f4f5","target":"graph","created_at":"2026-05-18T00:07:04Z","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":"For $d \\geq 2$ and $n \\in \\mathbb{N}$ even, let $p_n = p_n(d)$ denote the number of length $n$ self-avoiding polygons in $\\mathbb{Z}^d$ up to translation. The polygon cardinality grows exponentially, and the growth rate $\\lim_{n \\in 2\\mathbb{N}} p_n^{1/n} \\in (0,\\infty)$ is called the connective constant and denoted by $\\mu$. Madras [J. Statist. Phys. 78 (1995) no. 3--4, 681--699] has shown that $p_n \\mu^{-n} \\leq C n^{-1/2}$ in dimension $d=2$. Here we establish that $p_n \\mu^{-n} \\leq n^{-3/2 + o(1)}$ for a set of even $n$ of full density when $d=2$. We also consider a certain variant of sel","authors_text":"Alan Hammond","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-27T20:43:29Z","title":"An upper bound on the number of self-avoiding polygons via joining"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09032","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:bf50facc24de2c4b4d572315424a83226e51fb0f312130acec14d8cd410dd7aa","target":"record","created_at":"2026-05-18T00:07:04Z","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":"cbee08b2b5c4eefe5e9ca90e2bfdf2af20151b84bf62694ccc8eaa1b691da395","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-27T20:43:29Z","title_canon_sha256":"8b2e89bbb141c29b13a35fef13d32525cb8f94a891736198d0e98bd3a29321d5"},"schema_version":"1.0","source":{"id":"1808.09032","kind":"arxiv","version":1}},"canonical_sha256":"079258c50a43aeeac2ad2a6c962ebae5e20fcc1208c7a5310755a951254e7f03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"079258c50a43aeeac2ad2a6c962ebae5e20fcc1208c7a5310755a951254e7f03","first_computed_at":"2026-05-18T00:07:04.798582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:04.798582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xgydfrEizrMfV5/HCVDmsgGgt9FsX8CQwhBBA0FZg4ET+t1EvlH2tesmscwHka1O342Yg8UpHkM8kJXVoJOnDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:04.799221Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09032","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf50facc24de2c4b4d572315424a83226e51fb0f312130acec14d8cd410dd7aa","sha256:036d189183a31dc4f50de61e3384d7e83889baecf8887170040f1a6bdde0f4f5"],"state_sha256":"4d4af5a1e49d569bfc72eb3b6ab358d01611b589f7c0258b8ebefedc85277dfc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wv+5KV8TaUzTI5WcaB84/ZDA6iFWMJMoC/78CMQfoGK9u5gds8ZWRqbTF4tcRPlfEcnF57Be6iVZgj2lVlo0DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T03:04:09.999566Z","bundle_sha256":"d9628a2ca9ba4fa45ec0549246e3e99ca7164005112a3e61de3a39e32e44ff2a"}}