{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:KCJ2VHR2HYK3GRXMSHCQLDMJVE","short_pith_number":"pith:KCJ2VHR2","schema_version":"1.0","canonical_sha256":"5093aa9e3a3e15b346ec91c5058d89a9233ba71a72c577c99ab3330856dd3e99","source":{"kind":"arxiv","id":"2009.05120","version":1},"attestation_state":"computed","paper":{"title":"Cluster explorations of the loop soup on a metric graph related to the Gaussian free field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"elie aidekon","submitted_at":"2020-09-10T19:39:04Z","abstract_excerpt":"We consider the loop soup at intensity ${1\\over 2}$ conditioned on having local time $0$ on a set of vertices with positive occupation field in their vicinities. We give a relation between this loop soup and the usual loop soup conditioned on its local times. We deduce a domain Markov property for the loop soup, in the vein of the discrete Markov property proved by Werner: when exploring a cluster, the bridges outside the cluster form a Poisson point process. We show how it is related to the property due to Le Jan that the local times of the loop soup are distributed as the squares of a Gaussi"},"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":"2009.05120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2020-09-10T19:39:04Z","cross_cats_sorted":[],"title_canon_sha256":"d6e3623711c399227ab6c1cc61098cfdf2d65a891e0e9eff57f661f26276fa9e","abstract_canon_sha256":"03455a0c40a0658325985373b03006be043d1e0a174b274a25c82372011bfacc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:34:35.234575Z","signature_b64":"qVkO+zPMgT7ohVJ5pE1wNXA2Z1A7Tsa/vaSz7h9zq74qhniCfOrgGCcyKsPUGL0Gh9YkrcuAd89LbXJO3pdfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5093aa9e3a3e15b346ec91c5058d89a9233ba71a72c577c99ab3330856dd3e99","last_reissued_at":"2026-07-05T01:34:35.234211Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:34:35.234211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cluster explorations of the loop soup on a metric graph related to the Gaussian free field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"elie aidekon","submitted_at":"2020-09-10T19:39:04Z","abstract_excerpt":"We consider the loop soup at intensity ${1\\over 2}$ conditioned on having local time $0$ on a set of vertices with positive occupation field in their vicinities. We give a relation between this loop soup and the usual loop soup conditioned on its local times. We deduce a domain Markov property for the loop soup, in the vein of the discrete Markov property proved by Werner: when exploring a cluster, the bridges outside the cluster form a Poisson point process. We show how it is related to the property due to Le Jan that the local times of the loop soup are distributed as the squares of a Gaussi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.05120","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.05120/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2009.05120","created_at":"2026-07-05T01:34:35.234265+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.05120v1","created_at":"2026-07-05T01:34:35.234265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.05120","created_at":"2026-07-05T01:34:35.234265+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCJ2VHR2HYK3","created_at":"2026-07-05T01:34:35.234265+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCJ2VHR2HYK3GRXM","created_at":"2026-07-05T01:34:35.234265+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCJ2VHR2","created_at":"2026-07-05T01:34:35.234265+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06754","citing_title":"A switching identity for cable-graph loop soups and Gaussian free fields","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KCJ2VHR2HYK3GRXMSHCQLDMJVE","json":"https://pith.science/pith/KCJ2VHR2HYK3GRXMSHCQLDMJVE.json","graph_json":"https://pith.science/api/pith-number/KCJ2VHR2HYK3GRXMSHCQLDMJVE/graph.json","events_json":"https://pith.science/api/pith-number/KCJ2VHR2HYK3GRXMSHCQLDMJVE/events.json","paper":"https://pith.science/paper/KCJ2VHR2"},"agent_actions":{"view_html":"https://pith.science/pith/KCJ2VHR2HYK3GRXMSHCQLDMJVE","download_json":"https://pith.science/pith/KCJ2VHR2HYK3GRXMSHCQLDMJVE.json","view_paper":"https://pith.science/paper/KCJ2VHR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.05120&json=true","fetch_graph":"https://pith.science/api/pith-number/KCJ2VHR2HYK3GRXMSHCQLDMJVE/graph.json","fetch_events":"https://pith.science/api/pith-number/KCJ2VHR2HYK3GRXMSHCQLDMJVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCJ2VHR2HYK3GRXMSHCQLDMJVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCJ2VHR2HYK3GRXMSHCQLDMJVE/action/storage_attestation","attest_author":"https://pith.science/pith/KCJ2VHR2HYK3GRXMSHCQLDMJVE/action/author_attestation","sign_citation":"https://pith.science/pith/KCJ2VHR2HYK3GRXMSHCQLDMJVE/action/citation_signature","submit_replication":"https://pith.science/pith/KCJ2VHR2HYK3GRXMSHCQLDMJVE/action/replication_record"}},"created_at":"2026-07-05T01:34:35.234265+00:00","updated_at":"2026-07-05T01:34:35.234265+00:00"}