{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:I6VG4KE2WA2BCPWE63FXY7R5ML","short_pith_number":"pith:I6VG4KE2","canonical_record":{"source":{"id":"1902.08493","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-22T14:03:00Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"fe4383f578c6619cba37b368d327ef0b1d9211769c653a1b7ebe948e4c37f19a","abstract_canon_sha256":"1d38c5c3a2757f6e4da2a3e568d9b9336be32e7565ab1399ff1729e74a92e204"},"schema_version":"1.0"},"canonical_sha256":"47aa6e289ab034113ec4f6cb7c7e3d62e51e89346031d1e2fc7dfc896fa90529","source":{"kind":"arxiv","id":"1902.08493","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08493","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08493v2","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08493","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"pith_short_12","alias_value":"I6VG4KE2WA2B","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"I6VG4KE2WA2BCPWE","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"I6VG4KE2","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:I6VG4KE2WA2BCPWE63FXY7R5ML","target":"record","payload":{"canonical_record":{"source":{"id":"1902.08493","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-22T14:03:00Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"fe4383f578c6619cba37b368d327ef0b1d9211769c653a1b7ebe948e4c37f19a","abstract_canon_sha256":"1d38c5c3a2757f6e4da2a3e568d9b9336be32e7565ab1399ff1729e74a92e204"},"schema_version":"1.0"},"canonical_sha256":"47aa6e289ab034113ec4f6cb7c7e3d62e51e89346031d1e2fc7dfc896fa90529","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:30.610747Z","signature_b64":"yVYfab3AeUFc5cGpnjdHdKDbKgRLn3Omc0Tc9NXJYa7hkZO9EQzt1PPpwxxX9sgXFGxrpK5gdsyR9A1R7ccjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47aa6e289ab034113ec4f6cb7c7e3d62e51e89346031d1e2fc7dfc896fa90529","last_reissued_at":"2026-05-17T23:41:30.609879Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:30.609879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.08493","source_version":2,"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-17T23:41:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vd7K2cIPZxtQ+w0MpHOqcSpAWKRwMSOZHd/kIswhMdWNYCQOd/MRug9eY/pWRGtlntmgyr8KNXHncCqam5yYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:09:54.346801Z"},"content_sha256":"3c8c758e3695e705c2a730d3ee2b3e1d6907957a5d4a910e7e627b984541aab9","schema_version":"1.0","event_id":"sha256:3c8c758e3695e705c2a730d3ee2b3e1d6907957a5d4a910e7e627b984541aab9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:I6VG4KE2WA2BCPWE63FXY7R5ML","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A general bridge theorem for self-avoiding walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.CO","authors_text":"Christian Lindorfer","submitted_at":"2019-02-22T14:03:00Z","abstract_excerpt":"Let $X$ be an infinite, locally finite, connected, quasi-transitive graph without loops or multiple edges. A graph height function on $X$ is a map adapted to the graph structure, assigning to every vertex an integer, called height. Bridges are self-avoiding walks such that heights of interior vertices are bounded by the heights of the start- and end-vertex. The number of self-avoiding walks and the number of bridges of length $n$ starting at a vertex $o$ of $X$ grow exponentially in $n$ and the bases of these growth rates are called connective constant and bridge constant, respectively. We sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08493","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"},"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-17T23:41:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ySuBP83ViDEHQ0cl6wTSlFG/FtFsWjLhpFZF5xUoPscIQeiqZEZ4lt0jd36u2oSymxYqfKXw/pbPtOBhMIoYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:09:54.347147Z"},"content_sha256":"9b07cc034544bb754bb4fdcd23f301890eb5b99f6124bab2ba88ad557a7f5297","schema_version":"1.0","event_id":"sha256:9b07cc034544bb754bb4fdcd23f301890eb5b99f6124bab2ba88ad557a7f5297"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I6VG4KE2WA2BCPWE63FXY7R5ML/bundle.json","state_url":"https://pith.science/pith/I6VG4KE2WA2BCPWE63FXY7R5ML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I6VG4KE2WA2BCPWE63FXY7R5ML/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-04T14:09:54Z","links":{"resolver":"https://pith.science/pith/I6VG4KE2WA2BCPWE63FXY7R5ML","bundle":"https://pith.science/pith/I6VG4KE2WA2BCPWE63FXY7R5ML/bundle.json","state":"https://pith.science/pith/I6VG4KE2WA2BCPWE63FXY7R5ML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I6VG4KE2WA2BCPWE63FXY7R5ML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:I6VG4KE2WA2BCPWE63FXY7R5ML","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":"1d38c5c3a2757f6e4da2a3e568d9b9336be32e7565ab1399ff1729e74a92e204","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-22T14:03:00Z","title_canon_sha256":"fe4383f578c6619cba37b368d327ef0b1d9211769c653a1b7ebe948e4c37f19a"},"schema_version":"1.0","source":{"id":"1902.08493","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08493","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08493v2","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08493","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"pith_short_12","alias_value":"I6VG4KE2WA2B","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"I6VG4KE2WA2BCPWE","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"I6VG4KE2","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:9b07cc034544bb754bb4fdcd23f301890eb5b99f6124bab2ba88ad557a7f5297","target":"graph","created_at":"2026-05-17T23:41: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":"Let $X$ be an infinite, locally finite, connected, quasi-transitive graph without loops or multiple edges. A graph height function on $X$ is a map adapted to the graph structure, assigning to every vertex an integer, called height. Bridges are self-avoiding walks such that heights of interior vertices are bounded by the heights of the start- and end-vertex. The number of self-avoiding walks and the number of bridges of length $n$ starting at a vertex $o$ of $X$ grow exponentially in $n$ and the bases of these growth rates are called connective constant and bridge constant, respectively. We sho","authors_text":"Christian Lindorfer","cross_cats":["math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-22T14:03:00Z","title":"A general bridge theorem for self-avoiding walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08493","kind":"arxiv","version":2},"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:3c8c758e3695e705c2a730d3ee2b3e1d6907957a5d4a910e7e627b984541aab9","target":"record","created_at":"2026-05-17T23:41: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":"1d38c5c3a2757f6e4da2a3e568d9b9336be32e7565ab1399ff1729e74a92e204","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-22T14:03:00Z","title_canon_sha256":"fe4383f578c6619cba37b368d327ef0b1d9211769c653a1b7ebe948e4c37f19a"},"schema_version":"1.0","source":{"id":"1902.08493","kind":"arxiv","version":2}},"canonical_sha256":"47aa6e289ab034113ec4f6cb7c7e3d62e51e89346031d1e2fc7dfc896fa90529","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47aa6e289ab034113ec4f6cb7c7e3d62e51e89346031d1e2fc7dfc896fa90529","first_computed_at":"2026-05-17T23:41:30.609879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:30.609879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yVYfab3AeUFc5cGpnjdHdKDbKgRLn3Omc0Tc9NXJYa7hkZO9EQzt1PPpwxxX9sgXFGxrpK5gdsyR9A1R7ccjCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:30.610747Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08493","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c8c758e3695e705c2a730d3ee2b3e1d6907957a5d4a910e7e627b984541aab9","sha256:9b07cc034544bb754bb4fdcd23f301890eb5b99f6124bab2ba88ad557a7f5297"],"state_sha256":"18800852c4a41590578517521f06457a381e0e52f0b331ce026764d413eb7c90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cS1LHa0hwFICkxao/btzkLvbaFwVp2MKuYRHcQz9gHZfFl9GIEkt+IhqEqS5chs/qNsUjhHVIbSAgzjkQP89CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T14:09:54.349147Z","bundle_sha256":"00293850198eda29d2d8521ddba6599e3e751beac8a62cf6182908b46fbad69c"}}