{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:F637GLKNCT6AYT3HCMZYYZ23K6","short_pith_number":"pith:F637GLKN","canonical_record":{"source":{"id":"1411.6302","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2014-11-23T21:38:53Z","cross_cats_sorted":[],"title_canon_sha256":"596d04f5bc3b6ee06cf0579240a415b5e55a4813e824de8cba0ce83c5befcf03","abstract_canon_sha256":"d633646790f099cafe8063ae79f1a34a5175dc347803fec97442e39de7773a03"},"schema_version":"1.0"},"canonical_sha256":"2fb7f32d4d14fc0c4f6713338c675b5797e6ad58f76780728c7716719f4b8924","source":{"kind":"arxiv","id":"1411.6302","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6302","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6302v4","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6302","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"pith_short_12","alias_value":"F637GLKNCT6A","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"F637GLKNCT6AYT3H","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"F637GLKN","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:F637GLKNCT6AYT3HCMZYYZ23K6","target":"record","payload":{"canonical_record":{"source":{"id":"1411.6302","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2014-11-23T21:38:53Z","cross_cats_sorted":[],"title_canon_sha256":"596d04f5bc3b6ee06cf0579240a415b5e55a4813e824de8cba0ce83c5befcf03","abstract_canon_sha256":"d633646790f099cafe8063ae79f1a34a5175dc347803fec97442e39de7773a03"},"schema_version":"1.0"},"canonical_sha256":"2fb7f32d4d14fc0c4f6713338c675b5797e6ad58f76780728c7716719f4b8924","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:03.355006Z","signature_b64":"RDIcxxFElHbWZ7IQSH2IPZhwNChhokdLaPt9mc2kJsWcA7hBzVjJpbgX6DMzVE/LawuugFAlUi5EGtRJMybODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fb7f32d4d14fc0c4f6713338c675b5797e6ad58f76780728c7716719f4b8924","last_reissued_at":"2026-05-18T00:43:03.354454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:03.354454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.6302","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tUDjuNR/v87jXPXmNpG6NwmGO6+dJSD8BIP7bT0fT4M4sO1LnS0fqSESKA50ZlPW5tmdSE9411E4cqYGhl47BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:47:43.174056Z"},"content_sha256":"056d3dc573b0a3ac7288ef4e1e45e6a262f49320c333a19cc6a72a20f1d700ef","schema_version":"1.0","event_id":"sha256:056d3dc573b0a3ac7288ef4e1e45e6a262f49320c333a19cc6a72a20f1d700ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:F637GLKNCT6AYT3HCMZYYZ23K6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic constructions of relative train track maps and CTs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Mark Feighn, Michael Handel","submitted_at":"2014-11-23T21:38:53Z","abstract_excerpt":"Every rotationless outer automorphism of a finite rank free group is represented by a particularly useful relative train track map called a CT. The main result of this paper is that the constructions of CTs can be made algorithmic. A key step in our argument is proving that it is algorithmic to check if an inclusion of one invariant free factor system in another is reduced. Several applications are included, as well as algorithmic constructions for relative train track maps in the general case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6302","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MlBUWPaBA1Gh0tgP8rKOetVagM2Dv0Vh+StXyt8bn0MvBhS9BudEFL74Wc//zJKwMHwQxATjh8ycUTObAeB0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:47:43.174671Z"},"content_sha256":"584528b8c2faa2fcd9cc1134a50b686377c476e6e8ad2c1f063d986e5649e66d","schema_version":"1.0","event_id":"sha256:584528b8c2faa2fcd9cc1134a50b686377c476e6e8ad2c1f063d986e5649e66d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F637GLKNCT6AYT3HCMZYYZ23K6/bundle.json","state_url":"https://pith.science/pith/F637GLKNCT6AYT3HCMZYYZ23K6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F637GLKNCT6AYT3HCMZYYZ23K6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T15:47:43Z","links":{"resolver":"https://pith.science/pith/F637GLKNCT6AYT3HCMZYYZ23K6","bundle":"https://pith.science/pith/F637GLKNCT6AYT3HCMZYYZ23K6/bundle.json","state":"https://pith.science/pith/F637GLKNCT6AYT3HCMZYYZ23K6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F637GLKNCT6AYT3HCMZYYZ23K6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:F637GLKNCT6AYT3HCMZYYZ23K6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d633646790f099cafe8063ae79f1a34a5175dc347803fec97442e39de7773a03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2014-11-23T21:38:53Z","title_canon_sha256":"596d04f5bc3b6ee06cf0579240a415b5e55a4813e824de8cba0ce83c5befcf03"},"schema_version":"1.0","source":{"id":"1411.6302","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6302","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6302v4","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6302","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"pith_short_12","alias_value":"F637GLKNCT6A","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"F637GLKNCT6AYT3H","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"F637GLKN","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:584528b8c2faa2fcd9cc1134a50b686377c476e6e8ad2c1f063d986e5649e66d","target":"graph","created_at":"2026-05-18T00:43:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Every rotationless outer automorphism of a finite rank free group is represented by a particularly useful relative train track map called a CT. The main result of this paper is that the constructions of CTs can be made algorithmic. A key step in our argument is proving that it is algorithmic to check if an inclusion of one invariant free factor system in another is reduced. Several applications are included, as well as algorithmic constructions for relative train track maps in the general case.","authors_text":"Mark Feighn, Michael Handel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2014-11-23T21:38:53Z","title":"Algorithmic constructions of relative train track maps and CTs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6302","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:056d3dc573b0a3ac7288ef4e1e45e6a262f49320c333a19cc6a72a20f1d700ef","target":"record","created_at":"2026-05-18T00:43:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d633646790f099cafe8063ae79f1a34a5175dc347803fec97442e39de7773a03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2014-11-23T21:38:53Z","title_canon_sha256":"596d04f5bc3b6ee06cf0579240a415b5e55a4813e824de8cba0ce83c5befcf03"},"schema_version":"1.0","source":{"id":"1411.6302","kind":"arxiv","version":4}},"canonical_sha256":"2fb7f32d4d14fc0c4f6713338c675b5797e6ad58f76780728c7716719f4b8924","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fb7f32d4d14fc0c4f6713338c675b5797e6ad58f76780728c7716719f4b8924","first_computed_at":"2026-05-18T00:43:03.354454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:03.354454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RDIcxxFElHbWZ7IQSH2IPZhwNChhokdLaPt9mc2kJsWcA7hBzVjJpbgX6DMzVE/LawuugFAlUi5EGtRJMybODA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:03.355006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6302","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:056d3dc573b0a3ac7288ef4e1e45e6a262f49320c333a19cc6a72a20f1d700ef","sha256:584528b8c2faa2fcd9cc1134a50b686377c476e6e8ad2c1f063d986e5649e66d"],"state_sha256":"de928e3225c0116750a8666cc7662499ff704b883fe4f45159901910fe9b0c95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t4xSUILL1GxiC83F12UbQfcwhNSiZT0w5ajGVJHJbyGtu8FSej94QXr14koZtNgwI+Ed2xHsoQR8zdEUsN5bDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:47:43.177591Z","bundle_sha256":"a5d9e32d253c4913e8157c15439b5c1215cb26749ee33620ceb97d7250d911b0"}}