{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LFRGQ5AKNLMRM7GPPWNKVUYFQT","short_pith_number":"pith:LFRGQ5AK","canonical_record":{"source":{"id":"1309.0271","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-09-01T22:10:31Z","cross_cats_sorted":[],"title_canon_sha256":"ba189b5409f279b32d8798b15ad68c2d4a477a39331877a2e47384782d24227c","abstract_canon_sha256":"e404481e6a324e08887d05110227a94d68684f7bafaabb895a4cb8b6ffae348b"},"schema_version":"1.0"},"canonical_sha256":"596268740a6ad9167ccf7d9aaad30584efd5343cb2effc691d4eca002e60f443","source":{"kind":"arxiv","id":"1309.0271","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0271","created_at":"2026-05-18T01:21:14Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0271v3","created_at":"2026-05-18T01:21:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0271","created_at":"2026-05-18T01:21:14Z"},{"alias_kind":"pith_short_12","alias_value":"LFRGQ5AKNLMR","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LFRGQ5AKNLMRM7GP","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LFRGQ5AK","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LFRGQ5AKNLMRM7GPPWNKVUYFQT","target":"record","payload":{"canonical_record":{"source":{"id":"1309.0271","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-09-01T22:10:31Z","cross_cats_sorted":[],"title_canon_sha256":"ba189b5409f279b32d8798b15ad68c2d4a477a39331877a2e47384782d24227c","abstract_canon_sha256":"e404481e6a324e08887d05110227a94d68684f7bafaabb895a4cb8b6ffae348b"},"schema_version":"1.0"},"canonical_sha256":"596268740a6ad9167ccf7d9aaad30584efd5343cb2effc691d4eca002e60f443","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:14.038840Z","signature_b64":"f5igUXK7pOMz43YlZIeJR3FHKB0BjUjbQCjkhBJXKZ0Bj4GDjZOsXZAFOH7jHzqdZEjxedVbfa7BiQOORkHbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"596268740a6ad9167ccf7d9aaad30584efd5343cb2effc691d4eca002e60f443","last_reissued_at":"2026-05-18T01:21:14.038100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:14.038100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.0271","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-18T01:21:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qcy2JopCV67sJ5e9sIRGkyVBGQqlL2uEJG0R07mnZ5zNbeINK+wCUY4CqZUddwf7E+hdBkipKcFQ88Gf4UJcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:42:17.795397Z"},"content_sha256":"d1ad43cb8a148ff8cb116f76cc4af4a342e3c703ab534304fd215859bda0c02f","schema_version":"1.0","event_id":"sha256:d1ad43cb8a148ff8cb116f76cc4af4a342e3c703ab534304fd215859bda0c02f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LFRGQ5AKNLMRM7GPPWNKVUYFQT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On transitivity and (non)amenability of Aut(F_n) actions on group presentations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Aglaia Myropolska, Tatiana Nagnibeda","submitted_at":"2013-09-01T22:10:31Z","abstract_excerpt":"For a finitely generated group $G$ the Nielsen graph $N_n(G)$, $n\\geq \\operatorname{rank}(G)$, describes the action of the group $\\operatorname{Aut}F_n$ of automorphisms of the free group $F_n$ on generating $n$-tuples of G by elementary Nielsen moves. The question of (non)amenability of Nielsen graphs is of particular interest in relation with the open question about Property $(T)$ for $\\operatorname{Aut}F_n$, $n\\geq 4$. We prove nonamenability of Nielsen graphs $N_n(G)$ for all $n\\ge \\max\\{2,\\operatorname{rank}(G)\\}$ when $G$ is indicable, and for $n$ big enough when $G$ is elementary amenab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0271","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-18T01:21:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Z/3NYUGrmRzbludOdnA32OMJ1VewPCEhAy5+RDZjnRbmJvnXMmZwmV7QypoWw5GKyW5h45uyfWNb1en+/BPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:42:17.795740Z"},"content_sha256":"2cff14f69bda0c418a9af3b2476d24d7032912be743b62fc1a413d2691c6852d","schema_version":"1.0","event_id":"sha256:2cff14f69bda0c418a9af3b2476d24d7032912be743b62fc1a413d2691c6852d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFRGQ5AKNLMRM7GPPWNKVUYFQT/bundle.json","state_url":"https://pith.science/pith/LFRGQ5AKNLMRM7GPPWNKVUYFQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFRGQ5AKNLMRM7GPPWNKVUYFQT/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-06-20T07:42:17Z","links":{"resolver":"https://pith.science/pith/LFRGQ5AKNLMRM7GPPWNKVUYFQT","bundle":"https://pith.science/pith/LFRGQ5AKNLMRM7GPPWNKVUYFQT/bundle.json","state":"https://pith.science/pith/LFRGQ5AKNLMRM7GPPWNKVUYFQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFRGQ5AKNLMRM7GPPWNKVUYFQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LFRGQ5AKNLMRM7GPPWNKVUYFQT","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":"e404481e6a324e08887d05110227a94d68684f7bafaabb895a4cb8b6ffae348b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-09-01T22:10:31Z","title_canon_sha256":"ba189b5409f279b32d8798b15ad68c2d4a477a39331877a2e47384782d24227c"},"schema_version":"1.0","source":{"id":"1309.0271","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0271","created_at":"2026-05-18T01:21:14Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0271v3","created_at":"2026-05-18T01:21:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0271","created_at":"2026-05-18T01:21:14Z"},{"alias_kind":"pith_short_12","alias_value":"LFRGQ5AKNLMR","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LFRGQ5AKNLMRM7GP","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LFRGQ5AK","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:2cff14f69bda0c418a9af3b2476d24d7032912be743b62fc1a413d2691c6852d","target":"graph","created_at":"2026-05-18T01:21:14Z","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":"For a finitely generated group $G$ the Nielsen graph $N_n(G)$, $n\\geq \\operatorname{rank}(G)$, describes the action of the group $\\operatorname{Aut}F_n$ of automorphisms of the free group $F_n$ on generating $n$-tuples of G by elementary Nielsen moves. The question of (non)amenability of Nielsen graphs is of particular interest in relation with the open question about Property $(T)$ for $\\operatorname{Aut}F_n$, $n\\geq 4$. We prove nonamenability of Nielsen graphs $N_n(G)$ for all $n\\ge \\max\\{2,\\operatorname{rank}(G)\\}$ when $G$ is indicable, and for $n$ big enough when $G$ is elementary amenab","authors_text":"Aglaia Myropolska, Tatiana Nagnibeda","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-09-01T22:10:31Z","title":"On transitivity and (non)amenability of Aut(F_n) actions on group presentations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0271","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:d1ad43cb8a148ff8cb116f76cc4af4a342e3c703ab534304fd215859bda0c02f","target":"record","created_at":"2026-05-18T01:21:14Z","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":"e404481e6a324e08887d05110227a94d68684f7bafaabb895a4cb8b6ffae348b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-09-01T22:10:31Z","title_canon_sha256":"ba189b5409f279b32d8798b15ad68c2d4a477a39331877a2e47384782d24227c"},"schema_version":"1.0","source":{"id":"1309.0271","kind":"arxiv","version":3}},"canonical_sha256":"596268740a6ad9167ccf7d9aaad30584efd5343cb2effc691d4eca002e60f443","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"596268740a6ad9167ccf7d9aaad30584efd5343cb2effc691d4eca002e60f443","first_computed_at":"2026-05-18T01:21:14.038100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:14.038100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f5igUXK7pOMz43YlZIeJR3FHKB0BjUjbQCjkhBJXKZ0Bj4GDjZOsXZAFOH7jHzqdZEjxedVbfa7BiQOORkHbAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:14.038840Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0271","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1ad43cb8a148ff8cb116f76cc4af4a342e3c703ab534304fd215859bda0c02f","sha256:2cff14f69bda0c418a9af3b2476d24d7032912be743b62fc1a413d2691c6852d"],"state_sha256":"fe2b28ac797d235828b121535ecbe4cadd4254820869086c43f5c2a0cf638fd3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4xWfXVFrfnbvnmr8mO35+lfFiLSTBjPVw/NSH0V0cOsZprnXS5V9cl3z8Q7POPfOIeSuTkNqrZFfOhlN1V9wAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:42:17.797720Z","bundle_sha256":"5574f2f650af8eec90adbee0fddb88f5fafc36632df2cc07c712e4b8734f07c5"}}