{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IIKPJ46WF5WLYI2V34HWEM7536","short_pith_number":"pith:IIKPJ46W","schema_version":"1.0","canonical_sha256":"4214f4f3d62f6cbc2355df0f6233fddf910f93b0172aefaf0d9733a4f84c1256","source":{"kind":"arxiv","id":"1306.3091","version":4},"attestation_state":"computed","paper":{"title":"The straight line complexity of small factorials and primorials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.NT"],"primary_cat":"cs.CC","authors_text":"Klas Markstr\\\"om","submitted_at":"2013-06-13T12:08:12Z","abstract_excerpt":"In this paper we determine the straight-line complexity of $n!$ for $n\\leq 22$ and give bounds for the complexities up to $n=46$. In the same way we determine the straight-line complexity of the product of the first primes up to $p=31$ and gives bounds for $p\\leq 43$.\n  Our results are based on an exhaustive computer search of the short length straight-line programs."},"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":"1306.3091","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-06-13T12:08:12Z","cross_cats_sorted":["cs.DM","math.NT"],"title_canon_sha256":"64882d1554a26e908d10a26b59f0d38dac55e009a6a1732f3d4ec31ca49e76d0","abstract_canon_sha256":"59d320d19d02a1c2b881d9774cbeecbfe3a29682ee263eff554ceeda7a083e74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:27.550633Z","signature_b64":"GRuV/DDqzVezVLjxlkm3C2AMTEYxAbEC6g5weymRm0sPhbXJyYLF/2SKpaxKD/2lvsbrPJwlGJ7ku28lVinOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4214f4f3d62f6cbc2355df0f6233fddf910f93b0172aefaf0d9733a4f84c1256","last_reissued_at":"2026-05-18T02:31:27.550133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:27.550133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The straight line complexity of small factorials and primorials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.NT"],"primary_cat":"cs.CC","authors_text":"Klas Markstr\\\"om","submitted_at":"2013-06-13T12:08:12Z","abstract_excerpt":"In this paper we determine the straight-line complexity of $n!$ for $n\\leq 22$ and give bounds for the complexities up to $n=46$. In the same way we determine the straight-line complexity of the product of the first primes up to $p=31$ and gives bounds for $p\\leq 43$.\n  Our results are based on an exhaustive computer search of the short length straight-line programs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3091","kind":"arxiv","version":4},"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":"1306.3091","created_at":"2026-05-18T02:31:27.550207+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.3091v4","created_at":"2026-05-18T02:31:27.550207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3091","created_at":"2026-05-18T02:31:27.550207+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIKPJ46WF5WL","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIKPJ46WF5WLYI2V","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIKPJ46W","created_at":"2026-05-18T12:27:46.883200+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/IIKPJ46WF5WLYI2V34HWEM7536","json":"https://pith.science/pith/IIKPJ46WF5WLYI2V34HWEM7536.json","graph_json":"https://pith.science/api/pith-number/IIKPJ46WF5WLYI2V34HWEM7536/graph.json","events_json":"https://pith.science/api/pith-number/IIKPJ46WF5WLYI2V34HWEM7536/events.json","paper":"https://pith.science/paper/IIKPJ46W"},"agent_actions":{"view_html":"https://pith.science/pith/IIKPJ46WF5WLYI2V34HWEM7536","download_json":"https://pith.science/pith/IIKPJ46WF5WLYI2V34HWEM7536.json","view_paper":"https://pith.science/paper/IIKPJ46W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.3091&json=true","fetch_graph":"https://pith.science/api/pith-number/IIKPJ46WF5WLYI2V34HWEM7536/graph.json","fetch_events":"https://pith.science/api/pith-number/IIKPJ46WF5WLYI2V34HWEM7536/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIKPJ46WF5WLYI2V34HWEM7536/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIKPJ46WF5WLYI2V34HWEM7536/action/storage_attestation","attest_author":"https://pith.science/pith/IIKPJ46WF5WLYI2V34HWEM7536/action/author_attestation","sign_citation":"https://pith.science/pith/IIKPJ46WF5WLYI2V34HWEM7536/action/citation_signature","submit_replication":"https://pith.science/pith/IIKPJ46WF5WLYI2V34HWEM7536/action/replication_record"}},"created_at":"2026-05-18T02:31:27.550207+00:00","updated_at":"2026-05-18T02:31:27.550207+00:00"}