{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MYPGJMK6624CZNCFCTBQDAMB4Z","short_pith_number":"pith:MYPGJMK6","canonical_record":{"source":{"id":"1504.04187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-04-16T11:32:45Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"e214a37bfa04ae739fb3633d9dafb21561da44b403c966e774e812cfa75f8bf0","abstract_canon_sha256":"6bf4a3565fa061a87ece5a0c2cd2c5b99db4cef4ec464f0e1a1cf6ab66aee9d5"},"schema_version":"1.0"},"canonical_sha256":"661e64b15ef6b82cb44514c3018181e679dde07706983284909e58727013c46e","source":{"kind":"arxiv","id":"1504.04187","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04187","created_at":"2026-05-18T02:18:39Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04187v1","created_at":"2026-05-18T02:18:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04187","created_at":"2026-05-18T02:18:39Z"},{"alias_kind":"pith_short_12","alias_value":"MYPGJMK6624C","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MYPGJMK6624CZNCF","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MYPGJMK6","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MYPGJMK6624CZNCFCTBQDAMB4Z","target":"record","payload":{"canonical_record":{"source":{"id":"1504.04187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-04-16T11:32:45Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"e214a37bfa04ae739fb3633d9dafb21561da44b403c966e774e812cfa75f8bf0","abstract_canon_sha256":"6bf4a3565fa061a87ece5a0c2cd2c5b99db4cef4ec464f0e1a1cf6ab66aee9d5"},"schema_version":"1.0"},"canonical_sha256":"661e64b15ef6b82cb44514c3018181e679dde07706983284909e58727013c46e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:39.533072Z","signature_b64":"4C/sW4UYwP+SAacgmEu8+tv0Fx7QLMmnL8rwtNT7Ik/Q6JuMVN8j0hrXK48GUBraL11kfHymw0Q8WohCXsjWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"661e64b15ef6b82cb44514c3018181e679dde07706983284909e58727013c46e","last_reissued_at":"2026-05-18T02:18:39.532382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:39.532382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.04187","source_version":1,"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-18T02:18:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JG/TQqc9oGLMtjT1a6ahLlDcRLwXRtiI+Adl+TdJxY2hoqDIWNJA5I5Mut5R1apyqf2yPQM+kVtZXNPaZdMWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:03:26.904660Z"},"content_sha256":"ab25501d86c9a9608043aa88d0929e303c1bedd275236bf22db1a737c3173871","schema_version":"1.0","event_id":"sha256:ab25501d86c9a9608043aa88d0929e303c1bedd275236bf22db1a737c3173871"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MYPGJMK6624CZNCFCTBQDAMB4Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The complexity of balanced presentations and the Andrews-Curtis conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.GR","authors_text":"Martin R. Bridson","submitted_at":"2015-04-16T11:32:45Z","abstract_excerpt":"Motivated by problems in topology, we explore the complexity of balanced group presentations. We obtain large lower bounds on the complexity of Andrews-Curtis trivialisations, beginning in rank 4. Our results are based on a new understanding of how Dehn functions of groups behave under certain kinds of push-outs.\n  We consider groups $S$ with presentations of deficiency 1 satisfying certain technical conditions and construct balanced group presentations $\\P_w$ indexed by words $w$ in the generators of $S$. If $w=1$ in $S$ then $\\P_w$ is Andrews-Curtis trivialisable and the number of Andrews-Cu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04187","kind":"arxiv","version":1},"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-18T02:18:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VxzsJrtKE5/rSQzcXWGiujscnlGrYvfZU6jj8t7CNHkexzqxteKUYYLVNsHrhUEIINCIAFX+Pt6s/LtczVUjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:03:26.905053Z"},"content_sha256":"ea25e870f2e989cf32445f7a785520ebf9f143d7ce0cf5b6573e5767038ec7c8","schema_version":"1.0","event_id":"sha256:ea25e870f2e989cf32445f7a785520ebf9f143d7ce0cf5b6573e5767038ec7c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYPGJMK6624CZNCFCTBQDAMB4Z/bundle.json","state_url":"https://pith.science/pith/MYPGJMK6624CZNCFCTBQDAMB4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYPGJMK6624CZNCFCTBQDAMB4Z/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-01T02:03:26Z","links":{"resolver":"https://pith.science/pith/MYPGJMK6624CZNCFCTBQDAMB4Z","bundle":"https://pith.science/pith/MYPGJMK6624CZNCFCTBQDAMB4Z/bundle.json","state":"https://pith.science/pith/MYPGJMK6624CZNCFCTBQDAMB4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYPGJMK6624CZNCFCTBQDAMB4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MYPGJMK6624CZNCFCTBQDAMB4Z","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":"6bf4a3565fa061a87ece5a0c2cd2c5b99db4cef4ec464f0e1a1cf6ab66aee9d5","cross_cats_sorted":["math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-04-16T11:32:45Z","title_canon_sha256":"e214a37bfa04ae739fb3633d9dafb21561da44b403c966e774e812cfa75f8bf0"},"schema_version":"1.0","source":{"id":"1504.04187","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04187","created_at":"2026-05-18T02:18:39Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04187v1","created_at":"2026-05-18T02:18:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04187","created_at":"2026-05-18T02:18:39Z"},{"alias_kind":"pith_short_12","alias_value":"MYPGJMK6624C","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MYPGJMK6624CZNCF","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MYPGJMK6","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:ea25e870f2e989cf32445f7a785520ebf9f143d7ce0cf5b6573e5767038ec7c8","target":"graph","created_at":"2026-05-18T02:18:39Z","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":"Motivated by problems in topology, we explore the complexity of balanced group presentations. We obtain large lower bounds on the complexity of Andrews-Curtis trivialisations, beginning in rank 4. Our results are based on a new understanding of how Dehn functions of groups behave under certain kinds of push-outs.\n  We consider groups $S$ with presentations of deficiency 1 satisfying certain technical conditions and construct balanced group presentations $\\P_w$ indexed by words $w$ in the generators of $S$. If $w=1$ in $S$ then $\\P_w$ is Andrews-Curtis trivialisable and the number of Andrews-Cu","authors_text":"Martin R. Bridson","cross_cats":["math.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-04-16T11:32:45Z","title":"The complexity of balanced presentations and the Andrews-Curtis conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04187","kind":"arxiv","version":1},"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:ab25501d86c9a9608043aa88d0929e303c1bedd275236bf22db1a737c3173871","target":"record","created_at":"2026-05-18T02:18:39Z","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":"6bf4a3565fa061a87ece5a0c2cd2c5b99db4cef4ec464f0e1a1cf6ab66aee9d5","cross_cats_sorted":["math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-04-16T11:32:45Z","title_canon_sha256":"e214a37bfa04ae739fb3633d9dafb21561da44b403c966e774e812cfa75f8bf0"},"schema_version":"1.0","source":{"id":"1504.04187","kind":"arxiv","version":1}},"canonical_sha256":"661e64b15ef6b82cb44514c3018181e679dde07706983284909e58727013c46e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"661e64b15ef6b82cb44514c3018181e679dde07706983284909e58727013c46e","first_computed_at":"2026-05-18T02:18:39.532382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:39.532382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4C/sW4UYwP+SAacgmEu8+tv0Fx7QLMmnL8rwtNT7Ik/Q6JuMVN8j0hrXK48GUBraL11kfHymw0Q8WohCXsjWBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:39.533072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04187","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab25501d86c9a9608043aa88d0929e303c1bedd275236bf22db1a737c3173871","sha256:ea25e870f2e989cf32445f7a785520ebf9f143d7ce0cf5b6573e5767038ec7c8"],"state_sha256":"de7a5100cffa781380f6d925ca28503bd05d4713fa1250a6462d96fafe32408a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZlz5pXOau0gWNczZyqy80SsfOttsmE7wc1LlBcecsi2j8SC5znSrkBqAQPpn+3s6BPNuDH+2sDjJcD9Mgr2DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:03:26.908646Z","bundle_sha256":"d4b0b4086a4ee94fd758a5760c58d45f43dd14b522077ca482b0d3ee851b0532"}}