{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SOSPONMQ4KZZKS2LIJRDYAJDXJ","short_pith_number":"pith:SOSPONMQ","schema_version":"1.0","canonical_sha256":"93a4f73590e2b3954b4b42623c0123ba422e1aa816e97ab681b469fc3c0b2b73","source":{"kind":"arxiv","id":"1706.09679","version":1},"attestation_state":"computed","paper":{"title":"A graph-theoretic proof for Whitehead's second free-group algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Warren Dicks","submitted_at":"2017-06-29T11:20:28Z","abstract_excerpt":"J.H.C. Whitehead's second free-group algorithm determines whether or not two given elements of a free group lie in the same orbit of the automorphism group of the free group. The algorithm involves certain connected graphs, and Whitehead used three-manifold models to prove their connectedness; later, Rapaport and Higgins & Lyndon gave group-theoretic proofs. Combined work of Gersten, Stallings, and Hoare showed that the three-manifold models may be viewed as graphs. We give the direct translation of Whitehead's topological argument into the language of graph theory."},"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":"1706.09679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-06-29T11:20:28Z","cross_cats_sorted":[],"title_canon_sha256":"0c8da333feabdb18145949f4214e87b43673376be227526e9dc1794b0488b289","abstract_canon_sha256":"b1c671671479aaa88f64477bbe8817065fcb48b0ad1d3e658d4e2454d4d4cc13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:14.187865Z","signature_b64":"8KNLGHSXkPHFQbstmTuvhtFZlJeIlFaxzbJ+M40/WLKMG0cD8ifjGKzwW7rsCtacg6im8Bwmvb7wzaFa3dYNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93a4f73590e2b3954b4b42623c0123ba422e1aa816e97ab681b469fc3c0b2b73","last_reissued_at":"2026-05-18T00:41:14.187214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:14.187214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A graph-theoretic proof for Whitehead's second free-group algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Warren Dicks","submitted_at":"2017-06-29T11:20:28Z","abstract_excerpt":"J.H.C. Whitehead's second free-group algorithm determines whether or not two given elements of a free group lie in the same orbit of the automorphism group of the free group. The algorithm involves certain connected graphs, and Whitehead used three-manifold models to prove their connectedness; later, Rapaport and Higgins & Lyndon gave group-theoretic proofs. Combined work of Gersten, Stallings, and Hoare showed that the three-manifold models may be viewed as graphs. We give the direct translation of Whitehead's topological argument into the language of graph theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09679","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":"1706.09679","created_at":"2026-05-18T00:41:14.187329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.09679v1","created_at":"2026-05-18T00:41:14.187329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09679","created_at":"2026-05-18T00:41:14.187329+00:00"},{"alias_kind":"pith_short_12","alias_value":"SOSPONMQ4KZZ","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SOSPONMQ4KZZKS2L","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SOSPONMQ","created_at":"2026-05-18T12:31:43.269735+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/SOSPONMQ4KZZKS2LIJRDYAJDXJ","json":"https://pith.science/pith/SOSPONMQ4KZZKS2LIJRDYAJDXJ.json","graph_json":"https://pith.science/api/pith-number/SOSPONMQ4KZZKS2LIJRDYAJDXJ/graph.json","events_json":"https://pith.science/api/pith-number/SOSPONMQ4KZZKS2LIJRDYAJDXJ/events.json","paper":"https://pith.science/paper/SOSPONMQ"},"agent_actions":{"view_html":"https://pith.science/pith/SOSPONMQ4KZZKS2LIJRDYAJDXJ","download_json":"https://pith.science/pith/SOSPONMQ4KZZKS2LIJRDYAJDXJ.json","view_paper":"https://pith.science/paper/SOSPONMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.09679&json=true","fetch_graph":"https://pith.science/api/pith-number/SOSPONMQ4KZZKS2LIJRDYAJDXJ/graph.json","fetch_events":"https://pith.science/api/pith-number/SOSPONMQ4KZZKS2LIJRDYAJDXJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SOSPONMQ4KZZKS2LIJRDYAJDXJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SOSPONMQ4KZZKS2LIJRDYAJDXJ/action/storage_attestation","attest_author":"https://pith.science/pith/SOSPONMQ4KZZKS2LIJRDYAJDXJ/action/author_attestation","sign_citation":"https://pith.science/pith/SOSPONMQ4KZZKS2LIJRDYAJDXJ/action/citation_signature","submit_replication":"https://pith.science/pith/SOSPONMQ4KZZKS2LIJRDYAJDXJ/action/replication_record"}},"created_at":"2026-05-18T00:41:14.187329+00:00","updated_at":"2026-05-18T00:41:14.187329+00:00"}