{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:24CA7ZVMIF4TOMIYRYTZFI5AWC","short_pith_number":"pith:24CA7ZVM","canonical_record":{"source":{"id":"1106.0153","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2011-06-01T12:22:03Z","cross_cats_sorted":["hep-th","math.CO","math.MP"],"title_canon_sha256":"fad0d4674a7938c8c8867697dcb1ec2b74076696098f29e0723546a5ccf62285","abstract_canon_sha256":"83d9e8ba114b505dbdfe6508d770db1889f91cea516595e14063723d5d968d02"},"schema_version":"1.0"},"canonical_sha256":"d7040fe6ac41793731188e2792a3a0b0a42e2f8dacf62591d681820eb7ca08c7","source":{"kind":"arxiv","id":"1106.0153","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0153","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0153v3","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0153","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"24CA7ZVMIF4T","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"24CA7ZVMIF4TOMIY","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"24CA7ZVM","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:24CA7ZVMIF4TOMIYRYTZFI5AWC","target":"record","payload":{"canonical_record":{"source":{"id":"1106.0153","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2011-06-01T12:22:03Z","cross_cats_sorted":["hep-th","math.CO","math.MP"],"title_canon_sha256":"fad0d4674a7938c8c8867697dcb1ec2b74076696098f29e0723546a5ccf62285","abstract_canon_sha256":"83d9e8ba114b505dbdfe6508d770db1889f91cea516595e14063723d5d968d02"},"schema_version":"1.0"},"canonical_sha256":"d7040fe6ac41793731188e2792a3a0b0a42e2f8dacf62591d681820eb7ca08c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:38.681544Z","signature_b64":"pe4nJhPmyris8uK27TiMHO0GmM5sATl+p8xhjukSnPFomOKyIHXLD8a64ZXA7zAAT9RcudzW0rRQwsUSS1b1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7040fe6ac41793731188e2792a3a0b0a42e2f8dacf62591d681820eb7ca08c7","last_reissued_at":"2026-05-18T04:05:38.681004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:38.681004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.0153","source_version":3,"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-18T04:05:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a8PFibUCmGsnMyXK18Ca8pnSDn2ynKNU+eEyCu1cy+JNtx9cYDQA7xmLcvFbW5TMpdD3fhkY0OaEtDTt9mHkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:06:46.778114Z"},"content_sha256":"011899142c1b9ee137cc24d51ceee0993c95739d393c34d263a45c45e238a707","schema_version":"1.0","event_id":"sha256:011899142c1b9ee137cc24d51ceee0993c95739d393c34d263a45c45e238a707"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:24CA7ZVMIF4TOMIYRYTZFI5AWC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A recursive approach to the O(n) model on random maps via nested loops","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-th","math.CO","math.MP"],"primary_cat":"math-ph","authors_text":"E. Guitter (IPhT), G. Borot, J. Bouttier","submitted_at":"2011-06-01T12:22:03Z","abstract_excerpt":"We consider the O(n) loop model on tetravalent maps and show how to rephrase it into a model of bipartite maps without loops. This follows from a combinatorial decomposition that consists in cutting the O(n) model configurations along their loops so that each elementary piece is a map that may have arbitrary even face degrees. In the induced statistics, these maps are drawn according to a Boltzmann distribution whose parameters (the face weights) are determined by a fixed point condition. In particular, we show that the dense and dilute critical points of the O(n) model correspond to bipartite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0153","kind":"arxiv","version":3},"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-18T04:05:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gefi0JSE3Nss46pfS+Qy9ZcRcYUi/UrbJgi+zQIAVcPZLe43Wsr4nakXPbSU8byaYC0Q8nzwWhxQC+xqy+gvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:06:46.778478Z"},"content_sha256":"016b6334e7c2ecc6d7ae29bddf91ac54c2c103a954c30c6ad8a574eb8d9df987","schema_version":"1.0","event_id":"sha256:016b6334e7c2ecc6d7ae29bddf91ac54c2c103a954c30c6ad8a574eb8d9df987"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/24CA7ZVMIF4TOMIYRYTZFI5AWC/bundle.json","state_url":"https://pith.science/pith/24CA7ZVMIF4TOMIYRYTZFI5AWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/24CA7ZVMIF4TOMIYRYTZFI5AWC/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-01T12:06:46Z","links":{"resolver":"https://pith.science/pith/24CA7ZVMIF4TOMIYRYTZFI5AWC","bundle":"https://pith.science/pith/24CA7ZVMIF4TOMIYRYTZFI5AWC/bundle.json","state":"https://pith.science/pith/24CA7ZVMIF4TOMIYRYTZFI5AWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/24CA7ZVMIF4TOMIYRYTZFI5AWC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:24CA7ZVMIF4TOMIYRYTZFI5AWC","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":"83d9e8ba114b505dbdfe6508d770db1889f91cea516595e14063723d5d968d02","cross_cats_sorted":["hep-th","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2011-06-01T12:22:03Z","title_canon_sha256":"fad0d4674a7938c8c8867697dcb1ec2b74076696098f29e0723546a5ccf62285"},"schema_version":"1.0","source":{"id":"1106.0153","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0153","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0153v3","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0153","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"24CA7ZVMIF4T","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"24CA7ZVMIF4TOMIY","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"24CA7ZVM","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:016b6334e7c2ecc6d7ae29bddf91ac54c2c103a954c30c6ad8a574eb8d9df987","target":"graph","created_at":"2026-05-18T04:05:38Z","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 consider the O(n) loop model on tetravalent maps and show how to rephrase it into a model of bipartite maps without loops. This follows from a combinatorial decomposition that consists in cutting the O(n) model configurations along their loops so that each elementary piece is a map that may have arbitrary even face degrees. In the induced statistics, these maps are drawn according to a Boltzmann distribution whose parameters (the face weights) are determined by a fixed point condition. In particular, we show that the dense and dilute critical points of the O(n) model correspond to bipartite","authors_text":"E. Guitter (IPhT), G. Borot, J. Bouttier","cross_cats":["hep-th","math.CO","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2011-06-01T12:22:03Z","title":"A recursive approach to the O(n) model on random maps via nested loops"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0153","kind":"arxiv","version":3},"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:011899142c1b9ee137cc24d51ceee0993c95739d393c34d263a45c45e238a707","target":"record","created_at":"2026-05-18T04:05:38Z","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":"83d9e8ba114b505dbdfe6508d770db1889f91cea516595e14063723d5d968d02","cross_cats_sorted":["hep-th","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2011-06-01T12:22:03Z","title_canon_sha256":"fad0d4674a7938c8c8867697dcb1ec2b74076696098f29e0723546a5ccf62285"},"schema_version":"1.0","source":{"id":"1106.0153","kind":"arxiv","version":3}},"canonical_sha256":"d7040fe6ac41793731188e2792a3a0b0a42e2f8dacf62591d681820eb7ca08c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7040fe6ac41793731188e2792a3a0b0a42e2f8dacf62591d681820eb7ca08c7","first_computed_at":"2026-05-18T04:05:38.681004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:38.681004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pe4nJhPmyris8uK27TiMHO0GmM5sATl+p8xhjukSnPFomOKyIHXLD8a64ZXA7zAAT9RcudzW0rRQwsUSS1b1CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:38.681544Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.0153","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:011899142c1b9ee137cc24d51ceee0993c95739d393c34d263a45c45e238a707","sha256:016b6334e7c2ecc6d7ae29bddf91ac54c2c103a954c30c6ad8a574eb8d9df987"],"state_sha256":"d05b8f0bca5d54c3b44a4fd410f92431a0c076f751cf711a5871df06a9c76484"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XezW341lfhdAvvLhPxLIRSGvTTzU1ixtzI1MMWJAuBrhujXu6O3bu4GLw+xOACme5Y3O239ssyCpWOBjFIzrDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:06:46.780436Z","bundle_sha256":"8234dc8bb8a1f43c15a6b9fe70a9fb7324d2b16b4a484b5cc5f620e2e8f185bc"}}