{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:S6SULYJUYLAVNV2MRI7VASOP4D","short_pith_number":"pith:S6SULYJU","schema_version":"1.0","canonical_sha256":"97a545e134c2c156d74c8a3f5049cfe0cc890788d3f5771f0cf7c835fab2bab7","source":{"kind":"arxiv","id":"1008.4937","version":3},"attestation_state":"computed","paper":{"title":"Bounds on generalized Frobenius numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.MG"],"primary_cat":"math.NT","authors_text":"Achill Sch\\\"urmann, Lenny Fukshansky","submitted_at":"2010-08-29T15:32:47Z","abstract_excerpt":"Let $N \\geq 2$ and let $1 < a_1 < ... < a_N$ be relatively prime integers. The Frobenius number of this $N$-tuple is defined to be the largest positive integer that has no representation as $\\sum_{i=1}^N a_i x_i$ where $x_1,...,x_N$ are non-negative integers. More generally, the $s$-Frobenius number is defined to be the largest positive integer that has precisely $s$ distinct representations like this. We use techniques from the Geometry of Numbers to give upper and lower bounds on the $s$-Frobenius number for any nonnegative integer $s$."},"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":"1008.4937","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-08-29T15:32:47Z","cross_cats_sorted":["math.CO","math.MG"],"title_canon_sha256":"6940e821ade2ead53e116202769a2c3b0a24d384301363e89974085aebcd9361","abstract_canon_sha256":"c3362e7702c6f77ffd2d37742defc046a55b4c87c694b0b175dee635d726df72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:47.157046Z","signature_b64":"2rzuvY350fPOyy/Y+q5959Ije3ki8zSQAWl/lBOD8/DzENURVoIyHgHjN4IUQY0waxzJC/w3c0uyMYBJR7weDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97a545e134c2c156d74c8a3f5049cfe0cc890788d3f5771f0cf7c835fab2bab7","last_reissued_at":"2026-05-18T04:10:47.156469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:47.156469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on generalized Frobenius numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.MG"],"primary_cat":"math.NT","authors_text":"Achill Sch\\\"urmann, Lenny Fukshansky","submitted_at":"2010-08-29T15:32:47Z","abstract_excerpt":"Let $N \\geq 2$ and let $1 < a_1 < ... < a_N$ be relatively prime integers. The Frobenius number of this $N$-tuple is defined to be the largest positive integer that has no representation as $\\sum_{i=1}^N a_i x_i$ where $x_1,...,x_N$ are non-negative integers. More generally, the $s$-Frobenius number is defined to be the largest positive integer that has precisely $s$ distinct representations like this. We use techniques from the Geometry of Numbers to give upper and lower bounds on the $s$-Frobenius number for any nonnegative integer $s$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4937","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":"1008.4937","created_at":"2026-05-18T04:10:47.156552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.4937v3","created_at":"2026-05-18T04:10:47.156552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4937","created_at":"2026-05-18T04:10:47.156552+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6SULYJUYLAV","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6SULYJUYLAVNV2M","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6SULYJU","created_at":"2026-05-18T12:26:13.927090+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/S6SULYJUYLAVNV2MRI7VASOP4D","json":"https://pith.science/pith/S6SULYJUYLAVNV2MRI7VASOP4D.json","graph_json":"https://pith.science/api/pith-number/S6SULYJUYLAVNV2MRI7VASOP4D/graph.json","events_json":"https://pith.science/api/pith-number/S6SULYJUYLAVNV2MRI7VASOP4D/events.json","paper":"https://pith.science/paper/S6SULYJU"},"agent_actions":{"view_html":"https://pith.science/pith/S6SULYJUYLAVNV2MRI7VASOP4D","download_json":"https://pith.science/pith/S6SULYJUYLAVNV2MRI7VASOP4D.json","view_paper":"https://pith.science/paper/S6SULYJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.4937&json=true","fetch_graph":"https://pith.science/api/pith-number/S6SULYJUYLAVNV2MRI7VASOP4D/graph.json","fetch_events":"https://pith.science/api/pith-number/S6SULYJUYLAVNV2MRI7VASOP4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6SULYJUYLAVNV2MRI7VASOP4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6SULYJUYLAVNV2MRI7VASOP4D/action/storage_attestation","attest_author":"https://pith.science/pith/S6SULYJUYLAVNV2MRI7VASOP4D/action/author_attestation","sign_citation":"https://pith.science/pith/S6SULYJUYLAVNV2MRI7VASOP4D/action/citation_signature","submit_replication":"https://pith.science/pith/S6SULYJUYLAVNV2MRI7VASOP4D/action/replication_record"}},"created_at":"2026-05-18T04:10:47.156552+00:00","updated_at":"2026-05-18T04:10:47.156552+00:00"}