{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:S6SULYJUYLAVNV2MRI7VASOP4D","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c3362e7702c6f77ffd2d37742defc046a55b4c87c694b0b175dee635d726df72","cross_cats_sorted":["math.CO","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-08-29T15:32:47Z","title_canon_sha256":"6940e821ade2ead53e116202769a2c3b0a24d384301363e89974085aebcd9361"},"schema_version":"1.0","source":{"id":"1008.4937","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4937","created_at":"2026-05-18T04:10:47Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4937v3","created_at":"2026-05-18T04:10:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4937","created_at":"2026-05-18T04:10:47Z"},{"alias_kind":"pith_short_12","alias_value":"S6SULYJUYLAV","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"S6SULYJUYLAVNV2M","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"S6SULYJU","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:b1323c9128c03abc5b605618cbdc4200e12f2777ec160e42c0c560d380932155","target":"graph","created_at":"2026-05-18T04:10:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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$.","authors_text":"Achill Sch\\\"urmann, Lenny Fukshansky","cross_cats":["math.CO","math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-08-29T15:32:47Z","title":"Bounds on generalized Frobenius numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4937","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:51e139fbd6b01776fcd5b0c6240ac8fd85389aa5f6d93cbcaaecd4c8749c8bcf","target":"record","created_at":"2026-05-18T04:10:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c3362e7702c6f77ffd2d37742defc046a55b4c87c694b0b175dee635d726df72","cross_cats_sorted":["math.CO","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-08-29T15:32:47Z","title_canon_sha256":"6940e821ade2ead53e116202769a2c3b0a24d384301363e89974085aebcd9361"},"schema_version":"1.0","source":{"id":"1008.4937","kind":"arxiv","version":3}},"canonical_sha256":"97a545e134c2c156d74c8a3f5049cfe0cc890788d3f5771f0cf7c835fab2bab7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97a545e134c2c156d74c8a3f5049cfe0cc890788d3f5771f0cf7c835fab2bab7","first_computed_at":"2026-05-18T04:10:47.156469Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:47.156469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2rzuvY350fPOyy/Y+q5959Ije3ki8zSQAWl/lBOD8/DzENURVoIyHgHjN4IUQY0waxzJC/w3c0uyMYBJR7weDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:47.157046Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.4937","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51e139fbd6b01776fcd5b0c6240ac8fd85389aa5f6d93cbcaaecd4c8749c8bcf","sha256:b1323c9128c03abc5b605618cbdc4200e12f2777ec160e42c0c560d380932155"],"state_sha256":"967836a8b2416a717b61a368e9b4c4e5a7613f77f191577fa487f5da75f62d4e"}