{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XGS6D4SBVJF5ZF2B254JKOBHMZ","short_pith_number":"pith:XGS6D4SB","schema_version":"1.0","canonical_sha256":"b9a5e1f241aa4bdc9741d778953827665704dfaacefa499bc67543304eb13b4d","source":{"kind":"arxiv","id":"1412.3309","version":2},"attestation_state":"computed","paper":{"title":"On the Peterson hit problem","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Nguyen Sum","submitted_at":"2014-12-10T14:03:29Z","abstract_excerpt":"We study the hit problem, set up by F. Peterson, of finding a minimal set of generators for the polynomial algebra $P_k := \\mathbb F_2[x_1,x_2,...,x_k]$ as a module over the mod-2 Steenrod algebra, $\\mathcal{A}$. In this paper, we study a minimal set of generators for $\\mathcal A$-module $P_k$ in some so-call generic degrees and apply these results to explicitly determine the hit problem for $k=4$."},"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":"1412.3309","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.AT","submitted_at":"2014-12-10T14:03:29Z","cross_cats_sorted":[],"title_canon_sha256":"e197a0f24d93610787994f9bb49749265eea4a870b8a43e2f6aa75476ab46c3a","abstract_canon_sha256":"7b81f3dbe29cb51288aed176984f92b280df6ff1e51722835af1b0f85b95e025"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:13.611647Z","signature_b64":"t9OF1LkXmjM0gr6Y/NWHi9x1Sequ5Ejlsbuykjibt6icrL1hHGeELe+LEVoBR8zEk0wx/plym5lE5Tax6RwpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9a5e1f241aa4bdc9741d778953827665704dfaacefa499bc67543304eb13b4d","last_reissued_at":"2026-05-18T01:12:13.611032Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:13.611032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Peterson hit problem","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Nguyen Sum","submitted_at":"2014-12-10T14:03:29Z","abstract_excerpt":"We study the hit problem, set up by F. Peterson, of finding a minimal set of generators for the polynomial algebra $P_k := \\mathbb F_2[x_1,x_2,...,x_k]$ as a module over the mod-2 Steenrod algebra, $\\mathcal{A}$. In this paper, we study a minimal set of generators for $\\mathcal A$-module $P_k$ in some so-call generic degrees and apply these results to explicitly determine the hit problem for $k=4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3309","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":"1412.3309","created_at":"2026-05-18T01:12:13.611147+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3309v2","created_at":"2026-05-18T01:12:13.611147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3309","created_at":"2026-05-18T01:12:13.611147+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGS6D4SBVJF5","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGS6D4SBVJF5ZF2B","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGS6D4SB","created_at":"2026-05-18T12:28:57.508820+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/XGS6D4SBVJF5ZF2B254JKOBHMZ","json":"https://pith.science/pith/XGS6D4SBVJF5ZF2B254JKOBHMZ.json","graph_json":"https://pith.science/api/pith-number/XGS6D4SBVJF5ZF2B254JKOBHMZ/graph.json","events_json":"https://pith.science/api/pith-number/XGS6D4SBVJF5ZF2B254JKOBHMZ/events.json","paper":"https://pith.science/paper/XGS6D4SB"},"agent_actions":{"view_html":"https://pith.science/pith/XGS6D4SBVJF5ZF2B254JKOBHMZ","download_json":"https://pith.science/pith/XGS6D4SBVJF5ZF2B254JKOBHMZ.json","view_paper":"https://pith.science/paper/XGS6D4SB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3309&json=true","fetch_graph":"https://pith.science/api/pith-number/XGS6D4SBVJF5ZF2B254JKOBHMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/XGS6D4SBVJF5ZF2B254JKOBHMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGS6D4SBVJF5ZF2B254JKOBHMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGS6D4SBVJF5ZF2B254JKOBHMZ/action/storage_attestation","attest_author":"https://pith.science/pith/XGS6D4SBVJF5ZF2B254JKOBHMZ/action/author_attestation","sign_citation":"https://pith.science/pith/XGS6D4SBVJF5ZF2B254JKOBHMZ/action/citation_signature","submit_replication":"https://pith.science/pith/XGS6D4SBVJF5ZF2B254JKOBHMZ/action/replication_record"}},"created_at":"2026-05-18T01:12:13.611147+00:00","updated_at":"2026-05-18T01:12:13.611147+00:00"}