{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RJQZ3JVPBCIBAASM47JRAHCYSI","short_pith_number":"pith:RJQZ3JVP","canonical_record":{"source":{"id":"1609.03820","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-09-13T13:21:23Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"7ba493d0e28290aff64cd93c83da0c77ee7f52e58c54dd55f97dd33378956e6b","abstract_canon_sha256":"21853c4b7811c56d62d6875764fc193247bb41f57fd04ecab929191e6d79a3b6"},"schema_version":"1.0"},"canonical_sha256":"8a619da6af089010024ce7d3101c589207536efcf276e40c3525de7147df4730","source":{"kind":"arxiv","id":"1609.03820","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03820","created_at":"2026-05-18T00:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03820v3","created_at":"2026-05-18T00:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03820","created_at":"2026-05-18T00:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"RJQZ3JVPBCIB","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RJQZ3JVPBCIBAASM","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RJQZ3JVP","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RJQZ3JVPBCIBAASM47JRAHCYSI","target":"record","payload":{"canonical_record":{"source":{"id":"1609.03820","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-09-13T13:21:23Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"7ba493d0e28290aff64cd93c83da0c77ee7f52e58c54dd55f97dd33378956e6b","abstract_canon_sha256":"21853c4b7811c56d62d6875764fc193247bb41f57fd04ecab929191e6d79a3b6"},"schema_version":"1.0"},"canonical_sha256":"8a619da6af089010024ce7d3101c589207536efcf276e40c3525de7147df4730","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:15.491886Z","signature_b64":"AssD999ViSDUomYP1burW0Hx6rmU548doo4bg3S7uwg2xL7kJCxRSSJDTO4iiX9uGnxP1GA4TReHhn5aghETDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a619da6af089010024ce7d3101c589207536efcf276e40c3525de7147df4730","last_reissued_at":"2026-05-18T00:45:15.491284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:15.491284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.03820","source_version":3,"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:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JoPUC4aEehgV4EMFHdv692FzbxteXMbAdkAEJit/GV1IkG45SHKshiMNWNcZr/aI/E20lef348ItiBBqfx6xCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:06:39.592773Z"},"content_sha256":"fa19c304ff2c1ad7882b5027b5c8f0a1a39dd3f1f687dac183c0eb264ceac7df","schema_version":"1.0","event_id":"sha256:fa19c304ff2c1ad7882b5027b5c8f0a1a39dd3f1f687dac183c0eb264ceac7df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RJQZ3JVPBCIBAASM47JRAHCYSI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Detecting fully irreducible automorphisms: a polynomial time algorithm. With an appendix by Mark C. Bell","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.GR","authors_text":"Ilya Kapovich","submitted_at":"2016-09-13T13:21:23Z","abstract_excerpt":"In \\cite{Ka14} we produced an algorithm for deciding whether or not an element $\\phi\\in Out(F_N)$ is an iwip (\"fully irreducible\") automorphism. At several points that algorithm was rather inefficient as it involved some general enumeration procedures as well as running several abstract processes in parallel. In this paper we refine the algorithm from \\cite{Ka14} by eliminating these inefficient features, and also by eliminating any use of mapping class groups algorithms.\n  Our main result is to produce, for any fixed $N\\ge 3$, an algorithm which, given a topological representative $f$ of an e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03820","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"},"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:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VStEnqw2Cf2CyVMwNC+OMyE0dxyEzQhhNbXlWwwgUdCuSAYzOvzaWsgVLQbVlq3MXZf5HoeqLS+My+vo/073DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:06:39.593288Z"},"content_sha256":"10b6ed9d41d0ecba872214f1cd6ca75fff116d48b87015d5f96139210c20bd0f","schema_version":"1.0","event_id":"sha256:10b6ed9d41d0ecba872214f1cd6ca75fff116d48b87015d5f96139210c20bd0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RJQZ3JVPBCIBAASM47JRAHCYSI/bundle.json","state_url":"https://pith.science/pith/RJQZ3JVPBCIBAASM47JRAHCYSI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RJQZ3JVPBCIBAASM47JRAHCYSI/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-31T20:06:39Z","links":{"resolver":"https://pith.science/pith/RJQZ3JVPBCIBAASM47JRAHCYSI","bundle":"https://pith.science/pith/RJQZ3JVPBCIBAASM47JRAHCYSI/bundle.json","state":"https://pith.science/pith/RJQZ3JVPBCIBAASM47JRAHCYSI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RJQZ3JVPBCIBAASM47JRAHCYSI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RJQZ3JVPBCIBAASM47JRAHCYSI","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":"21853c4b7811c56d62d6875764fc193247bb41f57fd04ecab929191e6d79a3b6","cross_cats_sorted":["math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-09-13T13:21:23Z","title_canon_sha256":"7ba493d0e28290aff64cd93c83da0c77ee7f52e58c54dd55f97dd33378956e6b"},"schema_version":"1.0","source":{"id":"1609.03820","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03820","created_at":"2026-05-18T00:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03820v3","created_at":"2026-05-18T00:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03820","created_at":"2026-05-18T00:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"RJQZ3JVPBCIB","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RJQZ3JVPBCIBAASM","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RJQZ3JVP","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:10b6ed9d41d0ecba872214f1cd6ca75fff116d48b87015d5f96139210c20bd0f","target":"graph","created_at":"2026-05-18T00:45:15Z","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":"In \\cite{Ka14} we produced an algorithm for deciding whether or not an element $\\phi\\in Out(F_N)$ is an iwip (\"fully irreducible\") automorphism. At several points that algorithm was rather inefficient as it involved some general enumeration procedures as well as running several abstract processes in parallel. In this paper we refine the algorithm from \\cite{Ka14} by eliminating these inefficient features, and also by eliminating any use of mapping class groups algorithms.\n  Our main result is to produce, for any fixed $N\\ge 3$, an algorithm which, given a topological representative $f$ of an e","authors_text":"Ilya Kapovich","cross_cats":["math.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-09-13T13:21:23Z","title":"Detecting fully irreducible automorphisms: a polynomial time algorithm. With an appendix by Mark C. Bell"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03820","kind":"arxiv","version":3},"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:fa19c304ff2c1ad7882b5027b5c8f0a1a39dd3f1f687dac183c0eb264ceac7df","target":"record","created_at":"2026-05-18T00:45:15Z","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":"21853c4b7811c56d62d6875764fc193247bb41f57fd04ecab929191e6d79a3b6","cross_cats_sorted":["math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-09-13T13:21:23Z","title_canon_sha256":"7ba493d0e28290aff64cd93c83da0c77ee7f52e58c54dd55f97dd33378956e6b"},"schema_version":"1.0","source":{"id":"1609.03820","kind":"arxiv","version":3}},"canonical_sha256":"8a619da6af089010024ce7d3101c589207536efcf276e40c3525de7147df4730","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a619da6af089010024ce7d3101c589207536efcf276e40c3525de7147df4730","first_computed_at":"2026-05-18T00:45:15.491284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:15.491284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AssD999ViSDUomYP1burW0Hx6rmU548doo4bg3S7uwg2xL7kJCxRSSJDTO4iiX9uGnxP1GA4TReHhn5aghETDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:15.491886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03820","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa19c304ff2c1ad7882b5027b5c8f0a1a39dd3f1f687dac183c0eb264ceac7df","sha256:10b6ed9d41d0ecba872214f1cd6ca75fff116d48b87015d5f96139210c20bd0f"],"state_sha256":"e4303d7581a973419e69275488b18000ca6be38e0e5a75e87ca07c15876f9d56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YInqm/yT9JT7Hf/jZzSqdevNCHpztmirwTfyMuOZc9iekKWoaFrr556mqio/42JxrlJSpQHr7GUnvYjSPh3eBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:06:39.596501Z","bundle_sha256":"e19efccb7f3bdc2e793be2d3407446981de99d55f5445f017c44fd8dd7d56aa8"}}