{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HHP7AFC3DLCKZDKADBM5VS7PSB","short_pith_number":"pith:HHP7AFC3","schema_version":"1.0","canonical_sha256":"39dff0145b1ac4ac8d401859dacbef9065e03802624091f7da68cccd5b02f8a7","source":{"kind":"arxiv","id":"1311.0138","version":1},"attestation_state":"computed","paper":{"title":"On the length of the shortest non-trivial element in the derived and the lower central series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Abdelrhman Elkasapy, Andreas Thom","submitted_at":"2013-11-01T10:44:30Z","abstract_excerpt":"We provide upper and lower bounds on the length of the shortest non-trivial element in the derived series and lower central series in the free group on two generators. The techniques are used to provide new estimates on the nilpotent residual finiteness growth and on almost laws for compact groups."},"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":"1311.0138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-11-01T10:44:30Z","cross_cats_sorted":[],"title_canon_sha256":"429b9eb390efb2f9c1a353e00afbcf11bbcdf235553ed39123f50df1bd45821c","abstract_canon_sha256":"f27a50e0a8d1c12fa5657d655635cc3a983ce37865a5f71932acc435483bc4aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:15.444583Z","signature_b64":"0jfyzeWjoS3gbJHC/rzG2F2HVrgz83BlM2NyvK2uimMYdYCmEbykvPYYyPGX2rVbTxoGc72UCF5Nms5kD9mqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39dff0145b1ac4ac8d401859dacbef9065e03802624091f7da68cccd5b02f8a7","last_reissued_at":"2026-05-18T03:08:15.443997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:15.443997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the length of the shortest non-trivial element in the derived and the lower central series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Abdelrhman Elkasapy, Andreas Thom","submitted_at":"2013-11-01T10:44:30Z","abstract_excerpt":"We provide upper and lower bounds on the length of the shortest non-trivial element in the derived series and lower central series in the free group on two generators. The techniques are used to provide new estimates on the nilpotent residual finiteness growth and on almost laws for compact groups."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0138","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":"1311.0138","created_at":"2026-05-18T03:08:15.444096+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.0138v1","created_at":"2026-05-18T03:08:15.444096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0138","created_at":"2026-05-18T03:08:15.444096+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHP7AFC3DLCK","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHP7AFC3DLCKZDKA","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHP7AFC3","created_at":"2026-05-18T12:27:46.883200+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.05468","citing_title":"A Solovay-Kitaev theorem for quantum signal processing","ref_index":1988,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HHP7AFC3DLCKZDKADBM5VS7PSB","json":"https://pith.science/pith/HHP7AFC3DLCKZDKADBM5VS7PSB.json","graph_json":"https://pith.science/api/pith-number/HHP7AFC3DLCKZDKADBM5VS7PSB/graph.json","events_json":"https://pith.science/api/pith-number/HHP7AFC3DLCKZDKADBM5VS7PSB/events.json","paper":"https://pith.science/paper/HHP7AFC3"},"agent_actions":{"view_html":"https://pith.science/pith/HHP7AFC3DLCKZDKADBM5VS7PSB","download_json":"https://pith.science/pith/HHP7AFC3DLCKZDKADBM5VS7PSB.json","view_paper":"https://pith.science/paper/HHP7AFC3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.0138&json=true","fetch_graph":"https://pith.science/api/pith-number/HHP7AFC3DLCKZDKADBM5VS7PSB/graph.json","fetch_events":"https://pith.science/api/pith-number/HHP7AFC3DLCKZDKADBM5VS7PSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHP7AFC3DLCKZDKADBM5VS7PSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHP7AFC3DLCKZDKADBM5VS7PSB/action/storage_attestation","attest_author":"https://pith.science/pith/HHP7AFC3DLCKZDKADBM5VS7PSB/action/author_attestation","sign_citation":"https://pith.science/pith/HHP7AFC3DLCKZDKADBM5VS7PSB/action/citation_signature","submit_replication":"https://pith.science/pith/HHP7AFC3DLCKZDKADBM5VS7PSB/action/replication_record"}},"created_at":"2026-05-18T03:08:15.444096+00:00","updated_at":"2026-05-18T03:08:15.444096+00:00"}