{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZQAOOS2KEHOAN7CQF6YYERYIIW","short_pith_number":"pith:ZQAOOS2K","schema_version":"1.0","canonical_sha256":"cc00e74b4a21dc06fc502fb182470845928f09663b886c60eea909b07a014880","source":{"kind":"arxiv","id":"1408.1917","version":3},"attestation_state":"computed","paper":{"title":"Stallings graphs for quasi-convex subgroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Alexei Miasnikov, Olga Kharlampovich, Pascal Weil","submitted_at":"2014-08-08T17:10:16Z","abstract_excerpt":"We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are canonically associated with the corresponding subgroups. We show that this notion of Stallings graphs allows a unified approach to many algorithmic problems: some which had already been solved like the generalized membership problem or the computation of a quasi-convexity constant (Kapovich, 1996); and others such as the computation of intersections, the con"},"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":"1408.1917","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2014-08-08T17:10:16Z","cross_cats_sorted":[],"title_canon_sha256":"6c65845888c4132068a77780a253e6416e7767d9df9c949e3f36ed588a230a8e","abstract_canon_sha256":"046688acdeede38072e2a384128aa19b247575cf9503269748b006ef3f93f932"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:58.079816Z","signature_b64":"tQgFMpShOApmhC43YJjYFdbLDt8Mro09pV6mOjUjsN/TNSD6Ykqm3DODev7+gSXZbncGlcX/j/5z1aorTTPFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc00e74b4a21dc06fc502fb182470845928f09663b886c60eea909b07a014880","last_reissued_at":"2026-05-18T00:26:58.079199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:58.079199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stallings graphs for quasi-convex subgroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Alexei Miasnikov, Olga Kharlampovich, Pascal Weil","submitted_at":"2014-08-08T17:10:16Z","abstract_excerpt":"We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are canonically associated with the corresponding subgroups. We show that this notion of Stallings graphs allows a unified approach to many algorithmic problems: some which had already been solved like the generalized membership problem or the computation of a quasi-convexity constant (Kapovich, 1996); and others such as the computation of intersections, the con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1917","kind":"arxiv","version":3},"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":"1408.1917","created_at":"2026-05-18T00:26:58.079286+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.1917v3","created_at":"2026-05-18T00:26:58.079286+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1917","created_at":"2026-05-18T00:26:58.079286+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZQAOOS2KEHOA","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZQAOOS2KEHOAN7CQ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZQAOOS2K","created_at":"2026-05-18T12:28:59.999130+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/ZQAOOS2KEHOAN7CQF6YYERYIIW","json":"https://pith.science/pith/ZQAOOS2KEHOAN7CQF6YYERYIIW.json","graph_json":"https://pith.science/api/pith-number/ZQAOOS2KEHOAN7CQF6YYERYIIW/graph.json","events_json":"https://pith.science/api/pith-number/ZQAOOS2KEHOAN7CQF6YYERYIIW/events.json","paper":"https://pith.science/paper/ZQAOOS2K"},"agent_actions":{"view_html":"https://pith.science/pith/ZQAOOS2KEHOAN7CQF6YYERYIIW","download_json":"https://pith.science/pith/ZQAOOS2KEHOAN7CQF6YYERYIIW.json","view_paper":"https://pith.science/paper/ZQAOOS2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.1917&json=true","fetch_graph":"https://pith.science/api/pith-number/ZQAOOS2KEHOAN7CQF6YYERYIIW/graph.json","fetch_events":"https://pith.science/api/pith-number/ZQAOOS2KEHOAN7CQF6YYERYIIW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZQAOOS2KEHOAN7CQF6YYERYIIW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZQAOOS2KEHOAN7CQF6YYERYIIW/action/storage_attestation","attest_author":"https://pith.science/pith/ZQAOOS2KEHOAN7CQF6YYERYIIW/action/author_attestation","sign_citation":"https://pith.science/pith/ZQAOOS2KEHOAN7CQF6YYERYIIW/action/citation_signature","submit_replication":"https://pith.science/pith/ZQAOOS2KEHOAN7CQF6YYERYIIW/action/replication_record"}},"created_at":"2026-05-18T00:26:58.079286+00:00","updated_at":"2026-05-18T00:26:58.079286+00:00"}