{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:S6CTRI6LFXWHPGT7HLH4ZH3PYQ","short_pith_number":"pith:S6CTRI6L","schema_version":"1.0","canonical_sha256":"978538a3cb2dec779a7f3acfcc9f6fc4036e2a01bc593fde48bbbc64ef82b041","source":{"kind":"arxiv","id":"1004.0067","version":4},"attestation_state":"computed","paper":{"title":"Fast algorithmic Nielsen-Thurston classification of four-strand braids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Bert Wiest (IRMAR), Matthieu Calvez (IRMAR)","submitted_at":"2010-04-01T07:03:06Z","abstract_excerpt":"We give an algorithm which decides the Nielsen-Thurston type of a given four-strand braid. The complexity of our algorithm is quadratic with respect to word length. The proof of its validity is based on a result which states that for a reducible 4-braid which is as short as possible within its conjugacy class (short in the sense of Garside), reducing curves surrounding three punctures must be round or almost round."},"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":"1004.0067","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2010-04-01T07:03:06Z","cross_cats_sorted":[],"title_canon_sha256":"3b236691d0bd7ca50a3b624b603360d90f8d46288bb9cba787d6aa008ddb5078","abstract_canon_sha256":"2da3e2578bbb079a18bab68dceb3edabe2e6d7349f272ac5503362871c7b99ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:18.417709Z","signature_b64":"pX+VclzWXyNFcEzNlbSnQVc2SR6yqlc4jt/6BKNkxPc2YC/l8gPJl9N25FbWIzToFBpJ5mr56lw46hVleh+oBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"978538a3cb2dec779a7f3acfcc9f6fc4036e2a01bc593fde48bbbc64ef82b041","last_reissued_at":"2026-05-18T02:24:18.416982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:18.416982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast algorithmic Nielsen-Thurston classification of four-strand braids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Bert Wiest (IRMAR), Matthieu Calvez (IRMAR)","submitted_at":"2010-04-01T07:03:06Z","abstract_excerpt":"We give an algorithm which decides the Nielsen-Thurston type of a given four-strand braid. The complexity of our algorithm is quadratic with respect to word length. The proof of its validity is based on a result which states that for a reducible 4-braid which is as short as possible within its conjugacy class (short in the sense of Garside), reducing curves surrounding three punctures must be round or almost round."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0067","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":"1004.0067","created_at":"2026-05-18T02:24:18.417110+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.0067v4","created_at":"2026-05-18T02:24:18.417110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0067","created_at":"2026-05-18T02:24:18.417110+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6CTRI6LFXWH","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6CTRI6LFXWHPGT7","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6CTRI6L","created_at":"2026-05-18T12:26:13.927090+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/S6CTRI6LFXWHPGT7HLH4ZH3PYQ","json":"https://pith.science/pith/S6CTRI6LFXWHPGT7HLH4ZH3PYQ.json","graph_json":"https://pith.science/api/pith-number/S6CTRI6LFXWHPGT7HLH4ZH3PYQ/graph.json","events_json":"https://pith.science/api/pith-number/S6CTRI6LFXWHPGT7HLH4ZH3PYQ/events.json","paper":"https://pith.science/paper/S6CTRI6L"},"agent_actions":{"view_html":"https://pith.science/pith/S6CTRI6LFXWHPGT7HLH4ZH3PYQ","download_json":"https://pith.science/pith/S6CTRI6LFXWHPGT7HLH4ZH3PYQ.json","view_paper":"https://pith.science/paper/S6CTRI6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.0067&json=true","fetch_graph":"https://pith.science/api/pith-number/S6CTRI6LFXWHPGT7HLH4ZH3PYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/S6CTRI6LFXWHPGT7HLH4ZH3PYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6CTRI6LFXWHPGT7HLH4ZH3PYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6CTRI6LFXWHPGT7HLH4ZH3PYQ/action/storage_attestation","attest_author":"https://pith.science/pith/S6CTRI6LFXWHPGT7HLH4ZH3PYQ/action/author_attestation","sign_citation":"https://pith.science/pith/S6CTRI6LFXWHPGT7HLH4ZH3PYQ/action/citation_signature","submit_replication":"https://pith.science/pith/S6CTRI6LFXWHPGT7HLH4ZH3PYQ/action/replication_record"}},"created_at":"2026-05-18T02:24:18.417110+00:00","updated_at":"2026-05-18T02:24:18.417110+00:00"}