{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MJ45IROJJSTUH6RP2HG4TTS43V","short_pith_number":"pith:MJ45IROJ","schema_version":"1.0","canonical_sha256":"6279d445c94ca743fa2fd1cdc9ce5cdd7507b56085cc750411d9163e3fc71885","source":{"kind":"arxiv","id":"1405.0150","version":3},"attestation_state":"computed","paper":{"title":"On complexity of multiplication in finite soluble groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Alice C. Niemeyer, M.F. Newman","submitted_at":"2014-05-01T12:57:49Z","abstract_excerpt":"We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble, or polycyclic, group by restricting attention to certain polycyclic presentations of the group."},"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":"1405.0150","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2014-05-01T12:57:49Z","cross_cats_sorted":[],"title_canon_sha256":"eef4343ec3053ad4d5d1b51c07ba376260de1efe19b823247a17284d6ab56b87","abstract_canon_sha256":"e980ca385d44b997761b6bde2b68559296ecb84857fe0c13982f3efe6a938d81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:08.206206Z","signature_b64":"aG18wUxjrTMUIyzN4846GeP7PGAFt9ELoX7BY05BJSRw8kRB78UQHlcq6lAi3E7GGjLoALi6mGAw/gISSo4tDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6279d445c94ca743fa2fd1cdc9ce5cdd7507b56085cc750411d9163e3fc71885","last_reissued_at":"2026-05-18T02:44:08.205729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:08.205729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On complexity of multiplication in finite soluble groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Alice C. Niemeyer, M.F. Newman","submitted_at":"2014-05-01T12:57:49Z","abstract_excerpt":"We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble, or polycyclic, group by restricting attention to certain polycyclic presentations of the group."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0150","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.0150","created_at":"2026-05-18T02:44:08.205800+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.0150v3","created_at":"2026-05-18T02:44:08.205800+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0150","created_at":"2026-05-18T02:44:08.205800+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJ45IROJJSTU","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJ45IROJJSTUH6RP","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJ45IROJ","created_at":"2026-05-18T12:28:38.356838+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/MJ45IROJJSTUH6RP2HG4TTS43V","json":"https://pith.science/pith/MJ45IROJJSTUH6RP2HG4TTS43V.json","graph_json":"https://pith.science/api/pith-number/MJ45IROJJSTUH6RP2HG4TTS43V/graph.json","events_json":"https://pith.science/api/pith-number/MJ45IROJJSTUH6RP2HG4TTS43V/events.json","paper":"https://pith.science/paper/MJ45IROJ"},"agent_actions":{"view_html":"https://pith.science/pith/MJ45IROJJSTUH6RP2HG4TTS43V","download_json":"https://pith.science/pith/MJ45IROJJSTUH6RP2HG4TTS43V.json","view_paper":"https://pith.science/paper/MJ45IROJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.0150&json=true","fetch_graph":"https://pith.science/api/pith-number/MJ45IROJJSTUH6RP2HG4TTS43V/graph.json","fetch_events":"https://pith.science/api/pith-number/MJ45IROJJSTUH6RP2HG4TTS43V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJ45IROJJSTUH6RP2HG4TTS43V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJ45IROJJSTUH6RP2HG4TTS43V/action/storage_attestation","attest_author":"https://pith.science/pith/MJ45IROJJSTUH6RP2HG4TTS43V/action/author_attestation","sign_citation":"https://pith.science/pith/MJ45IROJJSTUH6RP2HG4TTS43V/action/citation_signature","submit_replication":"https://pith.science/pith/MJ45IROJJSTUH6RP2HG4TTS43V/action/replication_record"}},"created_at":"2026-05-18T02:44:08.205800+00:00","updated_at":"2026-05-18T02:44:08.205800+00:00"}