{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6LA7HJ6NT3B2MRSJISNCCBMYO3","short_pith_number":"pith:6LA7HJ6N","schema_version":"1.0","canonical_sha256":"f2c1f3a7cd9ec3a64649449a21059876e501d88a6c1e56cf591ba13f6d6b9b4e","source":{"kind":"arxiv","id":"1504.00418","version":2},"attestation_state":"computed","paper":{"title":"Balanced finite presentations of the trivial group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.GR","authors_text":"Boris Lishak","submitted_at":"2015-04-02T00:01:13Z","abstract_excerpt":"We construct a sequence of balanced finite presentations of the trivial group with two generators and two relators with the following property: The minimal number of relations required to demonstrate that a generator represents the trivial element grows faster than the tower of exponentials of any fixed height of the length of the finite presentation."},"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":"1504.00418","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-04-02T00:01:13Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"4be7d155ec56948ebe6fccf5891c6a3ea4d4131bbef81c331aad7bcb6e5cf8a8","abstract_canon_sha256":"7920eaebc4e80cbda8b48313d57f6b8e78785b35f8ac1a1b58ac095307b9bb15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:27.446833Z","signature_b64":"fytdN5wNh3Z0+erUW8oQ+Qtsl1RzpkhGmt/OYg3VTqE6U1fgGsVExHTXaTrI4azKkVqayAT/4SdkGbUdcBCpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2c1f3a7cd9ec3a64649449a21059876e501d88a6c1e56cf591ba13f6d6b9b4e","last_reissued_at":"2026-05-18T01:11:27.446116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:27.446116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Balanced finite presentations of the trivial group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.GR","authors_text":"Boris Lishak","submitted_at":"2015-04-02T00:01:13Z","abstract_excerpt":"We construct a sequence of balanced finite presentations of the trivial group with two generators and two relators with the following property: The minimal number of relations required to demonstrate that a generator represents the trivial element grows faster than the tower of exponentials of any fixed height of the length of the finite presentation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00418","kind":"arxiv","version":2},"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":"1504.00418","created_at":"2026-05-18T01:11:27.446235+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00418v2","created_at":"2026-05-18T01:11:27.446235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00418","created_at":"2026-05-18T01:11:27.446235+00:00"},{"alias_kind":"pith_short_12","alias_value":"6LA7HJ6NT3B2","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6LA7HJ6NT3B2MRSJ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6LA7HJ6N","created_at":"2026-05-18T12:29:07.941421+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/6LA7HJ6NT3B2MRSJISNCCBMYO3","json":"https://pith.science/pith/6LA7HJ6NT3B2MRSJISNCCBMYO3.json","graph_json":"https://pith.science/api/pith-number/6LA7HJ6NT3B2MRSJISNCCBMYO3/graph.json","events_json":"https://pith.science/api/pith-number/6LA7HJ6NT3B2MRSJISNCCBMYO3/events.json","paper":"https://pith.science/paper/6LA7HJ6N"},"agent_actions":{"view_html":"https://pith.science/pith/6LA7HJ6NT3B2MRSJISNCCBMYO3","download_json":"https://pith.science/pith/6LA7HJ6NT3B2MRSJISNCCBMYO3.json","view_paper":"https://pith.science/paper/6LA7HJ6N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00418&json=true","fetch_graph":"https://pith.science/api/pith-number/6LA7HJ6NT3B2MRSJISNCCBMYO3/graph.json","fetch_events":"https://pith.science/api/pith-number/6LA7HJ6NT3B2MRSJISNCCBMYO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6LA7HJ6NT3B2MRSJISNCCBMYO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6LA7HJ6NT3B2MRSJISNCCBMYO3/action/storage_attestation","attest_author":"https://pith.science/pith/6LA7HJ6NT3B2MRSJISNCCBMYO3/action/author_attestation","sign_citation":"https://pith.science/pith/6LA7HJ6NT3B2MRSJISNCCBMYO3/action/citation_signature","submit_replication":"https://pith.science/pith/6LA7HJ6NT3B2MRSJISNCCBMYO3/action/replication_record"}},"created_at":"2026-05-18T01:11:27.446235+00:00","updated_at":"2026-05-18T01:11:27.446235+00:00"}