{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:I6VG4KE2WA2BCPWE63FXY7R5ML","short_pith_number":"pith:I6VG4KE2","schema_version":"1.0","canonical_sha256":"47aa6e289ab034113ec4f6cb7c7e3d62e51e89346031d1e2fc7dfc896fa90529","source":{"kind":"arxiv","id":"1902.08493","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.08493","created_at":"2026-05-17T23:41:30.610022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08493v2","created_at":"2026-05-17T23:41:30.610022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08493","created_at":"2026-05-17T23:41:30.610022+00:00"},{"alias_kind":"pith_short_12","alias_value":"I6VG4KE2WA2B","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"I6VG4KE2WA2BCPWE","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"I6VG4KE2","created_at":"2026-05-18T12:33:18.533446+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/I6VG4KE2WA2BCPWE63FXY7R5ML","json":"https://pith.science/pith/I6VG4KE2WA2BCPWE63FXY7R5ML.json","graph_json":"https://pith.science/api/pith-number/I6VG4KE2WA2BCPWE63FXY7R5ML/graph.json","events_json":"https://pith.science/api/pith-number/I6VG4KE2WA2BCPWE63FXY7R5ML/events.json","paper":"https://pith.science/paper/I6VG4KE2"},"agent_actions":{"view_html":"https://pith.science/pith/I6VG4KE2WA2BCPWE63FXY7R5ML","download_json":"https://pith.science/pith/I6VG4KE2WA2BCPWE63FXY7R5ML.json","view_paper":"https://pith.science/paper/I6VG4KE2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08493&json=true","fetch_graph":"https://pith.science/api/pith-number/I6VG4KE2WA2BCPWE63FXY7R5ML/graph.json","fetch_events":"https://pith.science/api/pith-number/I6VG4KE2WA2BCPWE63FXY7R5ML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I6VG4KE2WA2BCPWE63FXY7R5ML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I6VG4KE2WA2BCPWE63FXY7R5ML/action/storage_attestation","attest_author":"https://pith.science/pith/I6VG4KE2WA2BCPWE63FXY7R5ML/action/author_attestation","sign_citation":"https://pith.science/pith/I6VG4KE2WA2BCPWE63FXY7R5ML/action/citation_signature","submit_replication":"https://pith.science/pith/I6VG4KE2WA2BCPWE63FXY7R5ML/action/replication_record"}},"created_at":"2026-05-17T23:41:30.610022+00:00","updated_at":"2026-05-17T23:41:30.610022+00:00"}