{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HJRNQTWYSQKGP5JGCZYF6X7NLM","short_pith_number":"pith:HJRNQTWY","schema_version":"1.0","canonical_sha256":"3a62d84ed8941467f52616705f5fed5b33158f95dceba139c570c2716576fc54","source":{"kind":"arxiv","id":"1310.6116","version":2},"attestation_state":"computed","paper":{"title":"Stationary random metrics on hierarchical graphs via $(\\min,+)$-type recursive distributional equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.DS","math.MP"],"primary_cat":"math.PR","authors_text":"Michele Triestino, Mikhail Khristoforov, Victor Kleptsyn","submitted_at":"2013-10-23T05:55:17Z","abstract_excerpt":"This paper is inspired by the problem of understanding in a mathematical sense the Liouville quantum gravity on surfaces. Here we show how to define a stationary random metric on self-similar spaces which are the limit of nice finite graphs: these are the so-called hierarchical graphs. They possess a well-defined level structure and any level is built using a simple recursion. Stopping the construction at any finite level, we have a discrete random metric space when we set the edges to have random length (using a multiplicative cascade with fixed law $m$). We introduce a tool, the cut-off proc"},"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":"1310.6116","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-10-23T05:55:17Z","cross_cats_sorted":["math-ph","math.DS","math.MP"],"title_canon_sha256":"f8bdc65c87e1608707f75eb813f0317acc9c4649fb17fecf43485809361fb0b6","abstract_canon_sha256":"4abb31fada6091d25140da92d98480f716499ac1d4b558059d3e71e8d3ba38d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:16.867312Z","signature_b64":"ar0d/tE3vMO/vUoHONP8PbM8hso4G1Jk4UgH0/J+bzzAlW8gGSIdYkK+acOutsn8cIsrARL8adXGI+3mTaUaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a62d84ed8941467f52616705f5fed5b33158f95dceba139c570c2716576fc54","last_reissued_at":"2026-05-18T01:33:16.866791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:16.866791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stationary random metrics on hierarchical graphs via $(\\min,+)$-type recursive distributional equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.DS","math.MP"],"primary_cat":"math.PR","authors_text":"Michele Triestino, Mikhail Khristoforov, Victor Kleptsyn","submitted_at":"2013-10-23T05:55:17Z","abstract_excerpt":"This paper is inspired by the problem of understanding in a mathematical sense the Liouville quantum gravity on surfaces. Here we show how to define a stationary random metric on self-similar spaces which are the limit of nice finite graphs: these are the so-called hierarchical graphs. They possess a well-defined level structure and any level is built using a simple recursion. Stopping the construction at any finite level, we have a discrete random metric space when we set the edges to have random length (using a multiplicative cascade with fixed law $m$). We introduce a tool, the cut-off proc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6116","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.6116","created_at":"2026-05-18T01:33:16.866883+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.6116v2","created_at":"2026-05-18T01:33:16.866883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6116","created_at":"2026-05-18T01:33:16.866883+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJRNQTWYSQKG","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJRNQTWYSQKGP5JG","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJRNQTWY","created_at":"2026-05-18T12:27:46.883200+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HJRNQTWYSQKGP5JGCZYF6X7NLM","json":"https://pith.science/pith/HJRNQTWYSQKGP5JGCZYF6X7NLM.json","graph_json":"https://pith.science/api/pith-number/HJRNQTWYSQKGP5JGCZYF6X7NLM/graph.json","events_json":"https://pith.science/api/pith-number/HJRNQTWYSQKGP5JGCZYF6X7NLM/events.json","paper":"https://pith.science/paper/HJRNQTWY"},"agent_actions":{"view_html":"https://pith.science/pith/HJRNQTWYSQKGP5JGCZYF6X7NLM","download_json":"https://pith.science/pith/HJRNQTWYSQKGP5JGCZYF6X7NLM.json","view_paper":"https://pith.science/paper/HJRNQTWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.6116&json=true","fetch_graph":"https://pith.science/api/pith-number/HJRNQTWYSQKGP5JGCZYF6X7NLM/graph.json","fetch_events":"https://pith.science/api/pith-number/HJRNQTWYSQKGP5JGCZYF6X7NLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJRNQTWYSQKGP5JGCZYF6X7NLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJRNQTWYSQKGP5JGCZYF6X7NLM/action/storage_attestation","attest_author":"https://pith.science/pith/HJRNQTWYSQKGP5JGCZYF6X7NLM/action/author_attestation","sign_citation":"https://pith.science/pith/HJRNQTWYSQKGP5JGCZYF6X7NLM/action/citation_signature","submit_replication":"https://pith.science/pith/HJRNQTWYSQKGP5JGCZYF6X7NLM/action/replication_record"}},"created_at":"2026-05-18T01:33:16.866883+00:00","updated_at":"2026-05-18T01:33:16.866883+00:00"}