{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6KUSAYSJHEFJRHWF7NPRHRNQT6","short_pith_number":"pith:6KUSAYSJ","canonical_record":{"source":{"id":"1806.09360","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-06-25T10:14:15Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"fdb7ae00cb81dceeee67f4d6b9bcd6484caf4c3cf2e62f2b2d675e4cf75a91d3","abstract_canon_sha256":"8a3dbd1aaaf9a2104b021eea0a468c320bbe4991c9900a1fd4ca8c566d65341a"},"schema_version":"1.0"},"canonical_sha256":"f2a9206249390a989ec5fb5f13c5b09f9648db07005ff8fe570d8c73fb137352","source":{"kind":"arxiv","id":"1806.09360","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09360","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09360v4","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09360","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"pith_short_12","alias_value":"6KUSAYSJHEFJ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6KUSAYSJHEFJRHWF","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6KUSAYSJ","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6KUSAYSJHEFJRHWF7NPRHRNQT6","target":"record","payload":{"canonical_record":{"source":{"id":"1806.09360","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-06-25T10:14:15Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"fdb7ae00cb81dceeee67f4d6b9bcd6484caf4c3cf2e62f2b2d675e4cf75a91d3","abstract_canon_sha256":"8a3dbd1aaaf9a2104b021eea0a468c320bbe4991c9900a1fd4ca8c566d65341a"},"schema_version":"1.0"},"canonical_sha256":"f2a9206249390a989ec5fb5f13c5b09f9648db07005ff8fe570d8c73fb137352","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:30.132968Z","signature_b64":"5i+O7ToQQybBHEQ28f0L8wQuf9wtYqs+iVT3YgvMnNsvcuGfAYqI0BPaaWren+gNiX8WM9xDr5b7SbnxIrTtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2a9206249390a989ec5fb5f13c5b09f9648db07005ff8fe570d8c73fb137352","last_reissued_at":"2026-05-18T00:00:30.132414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:30.132414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.09360","source_version":4,"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:00:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JieLSusCeId59UUVQyXFJeX5VWZ+37cqWTXOTsSTy4LcT5Ik3mxfn9T/YPyhW28Kd4Pr5wgDaGuRy27+laEgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T00:03:35.318651Z"},"content_sha256":"54e468e2e143680eebd2ac9df2ae9a5daf237011885d712ae5b8e67da74da112","schema_version":"1.0","event_id":"sha256:54e468e2e143680eebd2ac9df2ae9a5daf237011885d712ae5b8e67da74da112"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6KUSAYSJHEFJRHWF7NPRHRNQT6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shifted critical threshold in the loop $O(n)$ model at arbitrary small $n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Lorenzo Taggi","submitted_at":"2018-06-25T10:14:15Z","abstract_excerpt":"In the loop $O(n)$ model a collection of mutually-disjoint self-avoiding loops is drawn at random on a finite domain of a lattice with probability proportional to $${\\lambda^{\\# \\mbox{edges}} n^{\\# \\mbox{loops}},}$$ where $\\lambda, n \\in [0, \\infty)$. Let $\\mu$ be the connective constant of the lattice and, for any $n \\in [0, \\infty)$, let $\\lambda_c(n)$ be the largest value of $\\lambda$ such that the loop length admits uniformly bounded exponential moments. It is not difficult to prove that $\\lambda_c(n) =1/\\mu$ when $n=0$ (in this case the model corresponds to the self-avoiding walk) and tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09360","kind":"arxiv","version":4},"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:00:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f3fCB75mXDuEmgLw2QEGCQCORK2Nr8+J0raaLwbbyjrJGvuXErJmaLz/g8HD0kJ11dUDWmj7DpOa4inVJ9qUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T00:03:35.319408Z"},"content_sha256":"d27eb40f1809f6a70135f96d6ca34ba7921d20199a02df62fe7c1a1bfa536058","schema_version":"1.0","event_id":"sha256:d27eb40f1809f6a70135f96d6ca34ba7921d20199a02df62fe7c1a1bfa536058"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6KUSAYSJHEFJRHWF7NPRHRNQT6/bundle.json","state_url":"https://pith.science/pith/6KUSAYSJHEFJRHWF7NPRHRNQT6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6KUSAYSJHEFJRHWF7NPRHRNQT6/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-05-23T00:03:35Z","links":{"resolver":"https://pith.science/pith/6KUSAYSJHEFJRHWF7NPRHRNQT6","bundle":"https://pith.science/pith/6KUSAYSJHEFJRHWF7NPRHRNQT6/bundle.json","state":"https://pith.science/pith/6KUSAYSJHEFJRHWF7NPRHRNQT6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6KUSAYSJHEFJRHWF7NPRHRNQT6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6KUSAYSJHEFJRHWF7NPRHRNQT6","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":"8a3dbd1aaaf9a2104b021eea0a468c320bbe4991c9900a1fd4ca8c566d65341a","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-06-25T10:14:15Z","title_canon_sha256":"fdb7ae00cb81dceeee67f4d6b9bcd6484caf4c3cf2e62f2b2d675e4cf75a91d3"},"schema_version":"1.0","source":{"id":"1806.09360","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09360","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09360v4","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09360","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"pith_short_12","alias_value":"6KUSAYSJHEFJ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6KUSAYSJHEFJRHWF","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6KUSAYSJ","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:d27eb40f1809f6a70135f96d6ca34ba7921d20199a02df62fe7c1a1bfa536058","target":"graph","created_at":"2026-05-18T00:00:30Z","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":"In the loop $O(n)$ model a collection of mutually-disjoint self-avoiding loops is drawn at random on a finite domain of a lattice with probability proportional to $${\\lambda^{\\# \\mbox{edges}} n^{\\# \\mbox{loops}},}$$ where $\\lambda, n \\in [0, \\infty)$. Let $\\mu$ be the connective constant of the lattice and, for any $n \\in [0, \\infty)$, let $\\lambda_c(n)$ be the largest value of $\\lambda$ such that the loop length admits uniformly bounded exponential moments. It is not difficult to prove that $\\lambda_c(n) =1/\\mu$ when $n=0$ (in this case the model corresponds to the self-avoiding walk) and tha","authors_text":"Lorenzo Taggi","cross_cats":["math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-06-25T10:14:15Z","title":"Shifted critical threshold in the loop $O(n)$ model at arbitrary small $n$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09360","kind":"arxiv","version":4},"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:54e468e2e143680eebd2ac9df2ae9a5daf237011885d712ae5b8e67da74da112","target":"record","created_at":"2026-05-18T00:00:30Z","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":"8a3dbd1aaaf9a2104b021eea0a468c320bbe4991c9900a1fd4ca8c566d65341a","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-06-25T10:14:15Z","title_canon_sha256":"fdb7ae00cb81dceeee67f4d6b9bcd6484caf4c3cf2e62f2b2d675e4cf75a91d3"},"schema_version":"1.0","source":{"id":"1806.09360","kind":"arxiv","version":4}},"canonical_sha256":"f2a9206249390a989ec5fb5f13c5b09f9648db07005ff8fe570d8c73fb137352","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2a9206249390a989ec5fb5f13c5b09f9648db07005ff8fe570d8c73fb137352","first_computed_at":"2026-05-18T00:00:30.132414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:30.132414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5i+O7ToQQybBHEQ28f0L8wQuf9wtYqs+iVT3YgvMnNsvcuGfAYqI0BPaaWren+gNiX8WM9xDr5b7SbnxIrTtCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:30.132968Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09360","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54e468e2e143680eebd2ac9df2ae9a5daf237011885d712ae5b8e67da74da112","sha256:d27eb40f1809f6a70135f96d6ca34ba7921d20199a02df62fe7c1a1bfa536058"],"state_sha256":"b09a053be70e4570d07b4f4da1c39d7ac15d4a8c3da09af7655806a76a076a86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Z2+MzuZ0rXlflHKoQ4JR2M40hg7Ft/Jnd6UftiGuC33mh4c9WzS901TEGnmu+iSKuGGT9CuQVcgIo+G67q4Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T00:03:35.324301Z","bundle_sha256":"3535a48af0d0e46da7bcb2b3be6939186a63970bf220c681c1bffd1fa1ed8f2b"}}