{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:TAN4OJWWWJAUGJ5PSOS5AM7GTA","short_pith_number":"pith:TAN4OJWW","canonical_record":{"source":{"id":"1010.5415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-10-26T14:33:43Z","cross_cats_sorted":[],"title_canon_sha256":"db772a55f7a25f5c17edffa8004e9eeb21b73eb1054fe93f92d87f9629499d8d","abstract_canon_sha256":"9459f230a35e44633439c5c8bb0c53d3c6acb9b422f104d076b61cbfe8753191"},"schema_version":"1.0"},"canonical_sha256":"981bc726d6b2414327af93a5d033e6980990fbe6b376153b9b89aabba39c939c","source":{"kind":"arxiv","id":"1010.5415","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5415","created_at":"2026-05-18T03:15:45Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5415v1","created_at":"2026-05-18T03:15:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5415","created_at":"2026-05-18T03:15:45Z"},{"alias_kind":"pith_short_12","alias_value":"TAN4OJWWWJAU","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"TAN4OJWWWJAUGJ5P","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"TAN4OJWW","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:TAN4OJWWWJAUGJ5PSOS5AM7GTA","target":"record","payload":{"canonical_record":{"source":{"id":"1010.5415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-10-26T14:33:43Z","cross_cats_sorted":[],"title_canon_sha256":"db772a55f7a25f5c17edffa8004e9eeb21b73eb1054fe93f92d87f9629499d8d","abstract_canon_sha256":"9459f230a35e44633439c5c8bb0c53d3c6acb9b422f104d076b61cbfe8753191"},"schema_version":"1.0"},"canonical_sha256":"981bc726d6b2414327af93a5d033e6980990fbe6b376153b9b89aabba39c939c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:45.707229Z","signature_b64":"JhlFChSx7hRIYDeXmjJ8CrYDApRJwazTeyWN2135/chP/mdyx35V5A1kuY2tuFUtV9NYAqTfSyZmMwlJ+uouAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"981bc726d6b2414327af93a5d033e6980990fbe6b376153b9b89aabba39c939c","last_reissued_at":"2026-05-18T03:15:45.706412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:45.706412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.5415","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-18T03:15:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qy51fqucHPL89ynREZmAayHAIGQ0jn2GY9+f1kH+C1MwucUCQHTTn/GoyowOLpd4qfVAOWmCt/NMXFzJZ1I4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:52:35.745578Z"},"content_sha256":"7733c4a48344f124f5a1c6fe1a9cc452b55a6ea7f4ca1db4dd6131e26a1c4420","schema_version":"1.0","event_id":"sha256:7733c4a48344f124f5a1c6fe1a9cc452b55a6ea7f4ca1db4dd6131e26a1c4420"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:TAN4OJWWWJAUGJ5PSOS5AM7GTA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The problem of predecessors on spanning trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"V.B. Priezzhev, V.S. Poghosyan","submitted_at":"2010-10-26T14:33:43Z","abstract_excerpt":"We consider the equiprobable distribution of spanning trees on the square lattice. All bonds of each tree can be oriented uniquely with respect to an arbitrary chosen site called the root. The problem of predecessors is finding the probability that a path along the oriented bonds passes sequentially fixed sites $i$ and $j$. The conformal field theory for the Potts model predicts the fractal dimension of the path to be 5/4. Using this result, we show that the probability in the predecessors problem for two sites separated by large distance $r$ decreases as $P(r) \\sim r^{-3/4}$. If sites $i$ and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5415","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-18T03:15:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ytvBe2S3NcLpTfbw7yfc7ftz9DTk8QWht+mciW12es2wCGFRR7onqWrrjCowkPy8skLJPHM+UDZwOSbQs2fvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:52:35.746309Z"},"content_sha256":"bf50307d327431423e02888448da71a4576ba7a4368b998bde5cb8ec320ce382","schema_version":"1.0","event_id":"sha256:bf50307d327431423e02888448da71a4576ba7a4368b998bde5cb8ec320ce382"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TAN4OJWWWJAUGJ5PSOS5AM7GTA/bundle.json","state_url":"https://pith.science/pith/TAN4OJWWWJAUGJ5PSOS5AM7GTA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TAN4OJWWWJAUGJ5PSOS5AM7GTA/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-08T17:52:35Z","links":{"resolver":"https://pith.science/pith/TAN4OJWWWJAUGJ5PSOS5AM7GTA","bundle":"https://pith.science/pith/TAN4OJWWWJAUGJ5PSOS5AM7GTA/bundle.json","state":"https://pith.science/pith/TAN4OJWWWJAUGJ5PSOS5AM7GTA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TAN4OJWWWJAUGJ5PSOS5AM7GTA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:TAN4OJWWWJAUGJ5PSOS5AM7GTA","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":"9459f230a35e44633439c5c8bb0c53d3c6acb9b422f104d076b61cbfe8753191","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-10-26T14:33:43Z","title_canon_sha256":"db772a55f7a25f5c17edffa8004e9eeb21b73eb1054fe93f92d87f9629499d8d"},"schema_version":"1.0","source":{"id":"1010.5415","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5415","created_at":"2026-05-18T03:15:45Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5415v1","created_at":"2026-05-18T03:15:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5415","created_at":"2026-05-18T03:15:45Z"},{"alias_kind":"pith_short_12","alias_value":"TAN4OJWWWJAU","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"TAN4OJWWWJAUGJ5P","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"TAN4OJWW","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:bf50307d327431423e02888448da71a4576ba7a4368b998bde5cb8ec320ce382","target":"graph","created_at":"2026-05-18T03:15:45Z","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 equiprobable distribution of spanning trees on the square lattice. All bonds of each tree can be oriented uniquely with respect to an arbitrary chosen site called the root. The problem of predecessors is finding the probability that a path along the oriented bonds passes sequentially fixed sites $i$ and $j$. The conformal field theory for the Potts model predicts the fractal dimension of the path to be 5/4. Using this result, we show that the probability in the predecessors problem for two sites separated by large distance $r$ decreases as $P(r) \\sim r^{-3/4}$. If sites $i$ and","authors_text":"V.B. Priezzhev, V.S. Poghosyan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-10-26T14:33:43Z","title":"The problem of predecessors on spanning trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5415","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:7733c4a48344f124f5a1c6fe1a9cc452b55a6ea7f4ca1db4dd6131e26a1c4420","target":"record","created_at":"2026-05-18T03:15:45Z","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":"9459f230a35e44633439c5c8bb0c53d3c6acb9b422f104d076b61cbfe8753191","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-10-26T14:33:43Z","title_canon_sha256":"db772a55f7a25f5c17edffa8004e9eeb21b73eb1054fe93f92d87f9629499d8d"},"schema_version":"1.0","source":{"id":"1010.5415","kind":"arxiv","version":1}},"canonical_sha256":"981bc726d6b2414327af93a5d033e6980990fbe6b376153b9b89aabba39c939c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"981bc726d6b2414327af93a5d033e6980990fbe6b376153b9b89aabba39c939c","first_computed_at":"2026-05-18T03:15:45.706412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:45.706412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JhlFChSx7hRIYDeXmjJ8CrYDApRJwazTeyWN2135/chP/mdyx35V5A1kuY2tuFUtV9NYAqTfSyZmMwlJ+uouAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:45.707229Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.5415","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7733c4a48344f124f5a1c6fe1a9cc452b55a6ea7f4ca1db4dd6131e26a1c4420","sha256:bf50307d327431423e02888448da71a4576ba7a4368b998bde5cb8ec320ce382"],"state_sha256":"b8791ff46730846a8bbdfcec6c144fc5f1511e1362f534bae3e0c375f9fccc73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2Rudsxq7jogCi1GcdT3c0SniTtmKxfE8lh0uH7gjv0oeIkqTgXDvIhuUiLs86pdb2ST9VH8dfBEeyXMn4jDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:52:35.750253Z","bundle_sha256":"58d44d29f8b804154b82f1971c50d6a06addc72abce3cb20847ecab80850fcaf"}}