{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:I6GUWFADIV5FIKUAAV6BUVR6TC","short_pith_number":"pith:I6GUWFAD","schema_version":"1.0","canonical_sha256":"478d4b1403457a542a80057c1a563e98a556893350ad08297be1dde511a76bde","source":{"kind":"arxiv","id":"1903.02368","version":1},"attestation_state":"computed","paper":{"title":"The language of self-avoiding walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Christian Lindorfer, Wolfgang Woess","submitted_at":"2019-03-06T13:35:09Z","abstract_excerpt":"Let $X=(V\\!X,E\\!X)$ be an infinite, locally finite, connected graph without loops or multiple edges. We consider the edges to be oriented, and $E\\!X$ is equipped with an involution which inverts the orientation. Each oriented edge is labelled by an element of a finite alphabet $\\mathbf{\\Sigma}$. The labelling is assumed to be deterministic: edges with the same initial (resp. terminal) vertex have distinct labels. Furthermore it is assumed that the group of label-preserving automorphisms of $X$ acts quasi-transitively. For any vertex $o$ of $X$, consider the language of all words over $\\mathbf{"},"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":"1903.02368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-06T13:35:09Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"51b5117aa614a70521b32135558fb381fa1139264586f346e57e7818221055d5","abstract_canon_sha256":"89bf426519f3a57ef21bec189347f45e5f39f0ac697d7386aa042cfee37a0dee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:55.487341Z","signature_b64":"nyzuGCvmIkwB3xsTTEfuxE99qopGd1fPxkBBcJqf2FEfYatG/6bL0Q9jgsN3kl90kg5W3CN2UwcA5jiyi239CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"478d4b1403457a542a80057c1a563e98a556893350ad08297be1dde511a76bde","last_reissued_at":"2026-05-17T23:51:55.486923Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:55.486923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The language of self-avoiding walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Christian Lindorfer, Wolfgang Woess","submitted_at":"2019-03-06T13:35:09Z","abstract_excerpt":"Let $X=(V\\!X,E\\!X)$ be an infinite, locally finite, connected graph without loops or multiple edges. We consider the edges to be oriented, and $E\\!X$ is equipped with an involution which inverts the orientation. Each oriented edge is labelled by an element of a finite alphabet $\\mathbf{\\Sigma}$. The labelling is assumed to be deterministic: edges with the same initial (resp. terminal) vertex have distinct labels. Furthermore it is assumed that the group of label-preserving automorphisms of $X$ acts quasi-transitively. For any vertex $o$ of $X$, consider the language of all words over $\\mathbf{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02368","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.02368","created_at":"2026-05-17T23:51:55.486985+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.02368v1","created_at":"2026-05-17T23:51:55.486985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02368","created_at":"2026-05-17T23:51:55.486985+00:00"},{"alias_kind":"pith_short_12","alias_value":"I6GUWFADIV5F","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"I6GUWFADIV5FIKUA","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"I6GUWFAD","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/I6GUWFADIV5FIKUAAV6BUVR6TC","json":"https://pith.science/pith/I6GUWFADIV5FIKUAAV6BUVR6TC.json","graph_json":"https://pith.science/api/pith-number/I6GUWFADIV5FIKUAAV6BUVR6TC/graph.json","events_json":"https://pith.science/api/pith-number/I6GUWFADIV5FIKUAAV6BUVR6TC/events.json","paper":"https://pith.science/paper/I6GUWFAD"},"agent_actions":{"view_html":"https://pith.science/pith/I6GUWFADIV5FIKUAAV6BUVR6TC","download_json":"https://pith.science/pith/I6GUWFADIV5FIKUAAV6BUVR6TC.json","view_paper":"https://pith.science/paper/I6GUWFAD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.02368&json=true","fetch_graph":"https://pith.science/api/pith-number/I6GUWFADIV5FIKUAAV6BUVR6TC/graph.json","fetch_events":"https://pith.science/api/pith-number/I6GUWFADIV5FIKUAAV6BUVR6TC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I6GUWFADIV5FIKUAAV6BUVR6TC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I6GUWFADIV5FIKUAAV6BUVR6TC/action/storage_attestation","attest_author":"https://pith.science/pith/I6GUWFADIV5FIKUAAV6BUVR6TC/action/author_attestation","sign_citation":"https://pith.science/pith/I6GUWFADIV5FIKUAAV6BUVR6TC/action/citation_signature","submit_replication":"https://pith.science/pith/I6GUWFADIV5FIKUAAV6BUVR6TC/action/replication_record"}},"created_at":"2026-05-17T23:51:55.486985+00:00","updated_at":"2026-05-17T23:51:55.486985+00:00"}