{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:3I6QPO673K7HX45ILXSX4UVZRM","short_pith_number":"pith:3I6QPO67","schema_version":"1.0","canonical_sha256":"da3d07bbdfdabe7bf3a85de57e52b98b193b2e2ca15a005b82e5b403c91288cb","source":{"kind":"arxiv","id":"0907.4642","version":4},"attestation_state":"computed","paper":{"title":"A combinatorial proof of the Degree Theorem in Auter space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Matthew C. B. Zaremsky, Robert McEwen","submitted_at":"2009-07-27T14:34:01Z","abstract_excerpt":"We use discrete Morse theory to give a new proof of the Degree Theorem in Auter space A_n. There is a filtration of A_n into subspaces A_{n,k} using the degree of a graph, and the Degree Theorem says that each A_{n,k} is (k-1)-connected. This result is useful, for example to calculate stability bounds for the homology of Aut(F_n). The standard proof of the Degree Theorem is global in nature. Here we give a proof that only uses local considerations, and lends itself more readily to generalization."},"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":"0907.4642","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2009-07-27T14:34:01Z","cross_cats_sorted":[],"title_canon_sha256":"90f706a099ece2c5d448c4fb80943ef4bfd05304e6df3dceff11454728f2b5bb","abstract_canon_sha256":"99e01f7861059d6707de2d1b40b5a46fedc861edbeab9ee0ebb931cda92cbf1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:07.118882Z","signature_b64":"XpV3sgZA/ZLNhbXZughtIDg2wqJvPrvsQtpn19Pk1xmt/TbcoeAnNcBYhe+TTpHcwGavoo7c9YAGLE7WJVaGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da3d07bbdfdabe7bf3a85de57e52b98b193b2e2ca15a005b82e5b403c91288cb","last_reissued_at":"2026-05-18T02:57:07.118398Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:07.118398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A combinatorial proof of the Degree Theorem in Auter space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Matthew C. B. Zaremsky, Robert McEwen","submitted_at":"2009-07-27T14:34:01Z","abstract_excerpt":"We use discrete Morse theory to give a new proof of the Degree Theorem in Auter space A_n. There is a filtration of A_n into subspaces A_{n,k} using the degree of a graph, and the Degree Theorem says that each A_{n,k} is (k-1)-connected. This result is useful, for example to calculate stability bounds for the homology of Aut(F_n). The standard proof of the Degree Theorem is global in nature. Here we give a proof that only uses local considerations, and lends itself more readily to generalization."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.4642","kind":"arxiv","version":4},"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":"0907.4642","created_at":"2026-05-18T02:57:07.118472+00:00"},{"alias_kind":"arxiv_version","alias_value":"0907.4642v4","created_at":"2026-05-18T02:57:07.118472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.4642","created_at":"2026-05-18T02:57:07.118472+00:00"},{"alias_kind":"pith_short_12","alias_value":"3I6QPO673K7H","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"3I6QPO673K7HX45I","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"3I6QPO67","created_at":"2026-05-18T12:25:58.018023+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/3I6QPO673K7HX45ILXSX4UVZRM","json":"https://pith.science/pith/3I6QPO673K7HX45ILXSX4UVZRM.json","graph_json":"https://pith.science/api/pith-number/3I6QPO673K7HX45ILXSX4UVZRM/graph.json","events_json":"https://pith.science/api/pith-number/3I6QPO673K7HX45ILXSX4UVZRM/events.json","paper":"https://pith.science/paper/3I6QPO67"},"agent_actions":{"view_html":"https://pith.science/pith/3I6QPO673K7HX45ILXSX4UVZRM","download_json":"https://pith.science/pith/3I6QPO673K7HX45ILXSX4UVZRM.json","view_paper":"https://pith.science/paper/3I6QPO67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0907.4642&json=true","fetch_graph":"https://pith.science/api/pith-number/3I6QPO673K7HX45ILXSX4UVZRM/graph.json","fetch_events":"https://pith.science/api/pith-number/3I6QPO673K7HX45ILXSX4UVZRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3I6QPO673K7HX45ILXSX4UVZRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3I6QPO673K7HX45ILXSX4UVZRM/action/storage_attestation","attest_author":"https://pith.science/pith/3I6QPO673K7HX45ILXSX4UVZRM/action/author_attestation","sign_citation":"https://pith.science/pith/3I6QPO673K7HX45ILXSX4UVZRM/action/citation_signature","submit_replication":"https://pith.science/pith/3I6QPO673K7HX45ILXSX4UVZRM/action/replication_record"}},"created_at":"2026-05-18T02:57:07.118472+00:00","updated_at":"2026-05-18T02:57:07.118472+00:00"}