{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IFEBQR2D36PE4UFE3JMZ4SVCEM","short_pith_number":"pith:IFEBQR2D","schema_version":"1.0","canonical_sha256":"4148184743df9e4e50a4da599e4aa2230ea9a2d97e0eb3f0210bb9b3e937fd75","source":{"kind":"arxiv","id":"1112.0165","version":3},"attestation_state":"computed","paper":{"title":"Fast nielsen-thurston classification of braids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Matthieu Calvez","submitted_at":"2011-12-01T12:44:28Z","abstract_excerpt":"We prove the existence of an algorithm which solves the reducibility problem in braid groups and runs in quadratic time with respect to the braid length for any fixed braid index."},"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":"1112.0165","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2011-12-01T12:44:28Z","cross_cats_sorted":[],"title_canon_sha256":"e8726f65a8e34b1fab33de008618da44643299cac242c6e1ddcfde7e14155d30","abstract_canon_sha256":"50c1ebf1f7e337e556774fd27d604f8099491d9ecd6645330e2656648b20b811"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:43.521403Z","signature_b64":"PvdIft923eJmEBiH043yjPF3nQIxS2lH9zLlWPHHmfItHqybdAHj/tinq75A72OSP9fUECd9NM1Vcavun3xACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4148184743df9e4e50a4da599e4aa2230ea9a2d97e0eb3f0210bb9b3e937fd75","last_reissued_at":"2026-05-18T02:41:43.520781Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:43.520781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast nielsen-thurston classification of braids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Matthieu Calvez","submitted_at":"2011-12-01T12:44:28Z","abstract_excerpt":"We prove the existence of an algorithm which solves the reducibility problem in braid groups and runs in quadratic time with respect to the braid length for any fixed braid index."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0165","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":"1112.0165","created_at":"2026-05-18T02:41:43.520905+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.0165v3","created_at":"2026-05-18T02:41:43.520905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0165","created_at":"2026-05-18T02:41:43.520905+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFEBQR2D36PE","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFEBQR2D36PE4UFE","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFEBQR2D","created_at":"2026-05-18T12:26:30.835961+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/IFEBQR2D36PE4UFE3JMZ4SVCEM","json":"https://pith.science/pith/IFEBQR2D36PE4UFE3JMZ4SVCEM.json","graph_json":"https://pith.science/api/pith-number/IFEBQR2D36PE4UFE3JMZ4SVCEM/graph.json","events_json":"https://pith.science/api/pith-number/IFEBQR2D36PE4UFE3JMZ4SVCEM/events.json","paper":"https://pith.science/paper/IFEBQR2D"},"agent_actions":{"view_html":"https://pith.science/pith/IFEBQR2D36PE4UFE3JMZ4SVCEM","download_json":"https://pith.science/pith/IFEBQR2D36PE4UFE3JMZ4SVCEM.json","view_paper":"https://pith.science/paper/IFEBQR2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.0165&json=true","fetch_graph":"https://pith.science/api/pith-number/IFEBQR2D36PE4UFE3JMZ4SVCEM/graph.json","fetch_events":"https://pith.science/api/pith-number/IFEBQR2D36PE4UFE3JMZ4SVCEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFEBQR2D36PE4UFE3JMZ4SVCEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFEBQR2D36PE4UFE3JMZ4SVCEM/action/storage_attestation","attest_author":"https://pith.science/pith/IFEBQR2D36PE4UFE3JMZ4SVCEM/action/author_attestation","sign_citation":"https://pith.science/pith/IFEBQR2D36PE4UFE3JMZ4SVCEM/action/citation_signature","submit_replication":"https://pith.science/pith/IFEBQR2D36PE4UFE3JMZ4SVCEM/action/replication_record"}},"created_at":"2026-05-18T02:41:43.520905+00:00","updated_at":"2026-05-18T02:41:43.520905+00:00"}