{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QPJCMRINNXJYJUCVJUYXUJCMUF","short_pith_number":"pith:QPJCMRIN","schema_version":"1.0","canonical_sha256":"83d226450d6dd384d0554d317a244ca151555dc79e3a9242fe4443d581cd5c4d","source":{"kind":"arxiv","id":"1409.4129","version":1},"attestation_state":"computed","paper":{"title":"On a Frobenius problem for polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Miguel Rodriguez, Ricardo Concei\\c{c}\\~ao, Rodrigo Gondim","submitted_at":"2014-09-15T01:32:28Z","abstract_excerpt":"We extend the famous diophantine Frobenius problem to the case of polynomials over a field $k$. Similar to the classical problem, we show that the $n=2$ case of the Frobenius problem for polynomials is easy to solve. In addition, we translate a few results from the Frobenius problem over $\\mathbb{Z}$ to $k[t]$ and give an algorithm to solve the Frobenius problem for polynomials over a field $k$ of sufficiently large size."},"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":"1409.4129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-09-15T01:32:28Z","cross_cats_sorted":[],"title_canon_sha256":"88066af3f99098adda5f71675c77aa88b516557296173237e807d8d84e5777be","abstract_canon_sha256":"75a84481ba42dbf0220e3bef994a23b723708deeefe139417a2e9ff3368841a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:52.981393Z","signature_b64":"I84PKbdClVBOCEnXQAMxrZyqImKyaV3hSFR6AyCls980is/TyAqYW7QoFa31ZBx1wjbbg7q+aqshZoK/wmEzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83d226450d6dd384d0554d317a244ca151555dc79e3a9242fe4443d581cd5c4d","last_reissued_at":"2026-05-18T02:42:52.980955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:52.980955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a Frobenius problem for polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Miguel Rodriguez, Ricardo Concei\\c{c}\\~ao, Rodrigo Gondim","submitted_at":"2014-09-15T01:32:28Z","abstract_excerpt":"We extend the famous diophantine Frobenius problem to the case of polynomials over a field $k$. Similar to the classical problem, we show that the $n=2$ case of the Frobenius problem for polynomials is easy to solve. In addition, we translate a few results from the Frobenius problem over $\\mathbb{Z}$ to $k[t]$ and give an algorithm to solve the Frobenius problem for polynomials over a field $k$ of sufficiently large size."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4129","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.4129","created_at":"2026-05-18T02:42:52.981027+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.4129v1","created_at":"2026-05-18T02:42:52.981027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4129","created_at":"2026-05-18T02:42:52.981027+00:00"},{"alias_kind":"pith_short_12","alias_value":"QPJCMRINNXJY","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QPJCMRINNXJYJUCV","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QPJCMRIN","created_at":"2026-05-18T12:28:46.137349+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/QPJCMRINNXJYJUCVJUYXUJCMUF","json":"https://pith.science/pith/QPJCMRINNXJYJUCVJUYXUJCMUF.json","graph_json":"https://pith.science/api/pith-number/QPJCMRINNXJYJUCVJUYXUJCMUF/graph.json","events_json":"https://pith.science/api/pith-number/QPJCMRINNXJYJUCVJUYXUJCMUF/events.json","paper":"https://pith.science/paper/QPJCMRIN"},"agent_actions":{"view_html":"https://pith.science/pith/QPJCMRINNXJYJUCVJUYXUJCMUF","download_json":"https://pith.science/pith/QPJCMRINNXJYJUCVJUYXUJCMUF.json","view_paper":"https://pith.science/paper/QPJCMRIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.4129&json=true","fetch_graph":"https://pith.science/api/pith-number/QPJCMRINNXJYJUCVJUYXUJCMUF/graph.json","fetch_events":"https://pith.science/api/pith-number/QPJCMRINNXJYJUCVJUYXUJCMUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QPJCMRINNXJYJUCVJUYXUJCMUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QPJCMRINNXJYJUCVJUYXUJCMUF/action/storage_attestation","attest_author":"https://pith.science/pith/QPJCMRINNXJYJUCVJUYXUJCMUF/action/author_attestation","sign_citation":"https://pith.science/pith/QPJCMRINNXJYJUCVJUYXUJCMUF/action/citation_signature","submit_replication":"https://pith.science/pith/QPJCMRINNXJYJUCVJUYXUJCMUF/action/replication_record"}},"created_at":"2026-05-18T02:42:52.981027+00:00","updated_at":"2026-05-18T02:42:52.981027+00:00"}