{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AJRZ4O6BQ5WPWMP4VACO6NFGYK","short_pith_number":"pith:AJRZ4O6B","schema_version":"1.0","canonical_sha256":"02639e3bc1876cfb31fca804ef34a6c2b773748570b415353c6a7be69ba3b3ee","source":{"kind":"arxiv","id":"1605.03907","version":1},"attestation_state":"computed","paper":{"title":"A combinatorial problem and numerical semigroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.NT"],"primary_cat":"math.CO","authors_text":"Aureliano M. Robles-P\\'erez, Jos\\'e Carlos Rosales","submitted_at":"2016-05-12T17:29:49Z","abstract_excerpt":"Let $a=(a_1,\\ldots,a_n)$ and $b=(b_1,\\ldots,b_n)$ be two $n$-tuples of positive integers, let $X$ be a set of positive integers, and let $g$ be a positive integer. In this work we show an algorithmic process in order to compute all the sets $C$ of positive integers that fulfill the following conditions: 1) the cardinality of $C$ is equal to $g$; 2) if $x,y\\in \\mathbb{N} \\setminus \\{0\\}$ and $x+y\\in C$, then $C \\cap \\{x,y\\} \\neq \\emptyset$; 3) if $x \\in C$ and $\\frac{x-b_i}{a_i} \\in \\mathbb{N} \\setminus \\{0\\}$ for some $i\\in \\{1,\\ldots,n\\}$, then $\\frac{x-b_i}{a_i} \\in C$; 4) $X \\cap C = \\empty"},"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":"1605.03907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-12T17:29:49Z","cross_cats_sorted":["math.GR","math.NT"],"title_canon_sha256":"93f1827ab5da5a58fc309bc3975737dbc7a3c02d398ceef452df4600980bc050","abstract_canon_sha256":"4a0dadabecd1755188be67fe2edf70a738dfc1da5f3dcd475e9942ffc4039e22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:06.526471Z","signature_b64":"Cz8YjbpwZfQCnW7lOIglDBqmLOEZrdjLnUybssfaE4uhYcrJ/lSWWE3pbK8lJsR6oVl899Ozb8f57vM/hKdMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02639e3bc1876cfb31fca804ef34a6c2b773748570b415353c6a7be69ba3b3ee","last_reissued_at":"2026-05-17T23:49:06.525829Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:06.525829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A combinatorial problem and numerical semigroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.NT"],"primary_cat":"math.CO","authors_text":"Aureliano M. Robles-P\\'erez, Jos\\'e Carlos Rosales","submitted_at":"2016-05-12T17:29:49Z","abstract_excerpt":"Let $a=(a_1,\\ldots,a_n)$ and $b=(b_1,\\ldots,b_n)$ be two $n$-tuples of positive integers, let $X$ be a set of positive integers, and let $g$ be a positive integer. In this work we show an algorithmic process in order to compute all the sets $C$ of positive integers that fulfill the following conditions: 1) the cardinality of $C$ is equal to $g$; 2) if $x,y\\in \\mathbb{N} \\setminus \\{0\\}$ and $x+y\\in C$, then $C \\cap \\{x,y\\} \\neq \\emptyset$; 3) if $x \\in C$ and $\\frac{x-b_i}{a_i} \\in \\mathbb{N} \\setminus \\{0\\}$ for some $i\\in \\{1,\\ldots,n\\}$, then $\\frac{x-b_i}{a_i} \\in C$; 4) $X \\cap C = \\empty"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03907","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":"1605.03907","created_at":"2026-05-17T23:49:06.525946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03907v1","created_at":"2026-05-17T23:49:06.525946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03907","created_at":"2026-05-17T23:49:06.525946+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJRZ4O6BQ5WP","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJRZ4O6BQ5WPWMP4","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJRZ4O6B","created_at":"2026-05-18T12:30:07.202191+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/AJRZ4O6BQ5WPWMP4VACO6NFGYK","json":"https://pith.science/pith/AJRZ4O6BQ5WPWMP4VACO6NFGYK.json","graph_json":"https://pith.science/api/pith-number/AJRZ4O6BQ5WPWMP4VACO6NFGYK/graph.json","events_json":"https://pith.science/api/pith-number/AJRZ4O6BQ5WPWMP4VACO6NFGYK/events.json","paper":"https://pith.science/paper/AJRZ4O6B"},"agent_actions":{"view_html":"https://pith.science/pith/AJRZ4O6BQ5WPWMP4VACO6NFGYK","download_json":"https://pith.science/pith/AJRZ4O6BQ5WPWMP4VACO6NFGYK.json","view_paper":"https://pith.science/paper/AJRZ4O6B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03907&json=true","fetch_graph":"https://pith.science/api/pith-number/AJRZ4O6BQ5WPWMP4VACO6NFGYK/graph.json","fetch_events":"https://pith.science/api/pith-number/AJRZ4O6BQ5WPWMP4VACO6NFGYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJRZ4O6BQ5WPWMP4VACO6NFGYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJRZ4O6BQ5WPWMP4VACO6NFGYK/action/storage_attestation","attest_author":"https://pith.science/pith/AJRZ4O6BQ5WPWMP4VACO6NFGYK/action/author_attestation","sign_citation":"https://pith.science/pith/AJRZ4O6BQ5WPWMP4VACO6NFGYK/action/citation_signature","submit_replication":"https://pith.science/pith/AJRZ4O6BQ5WPWMP4VACO6NFGYK/action/replication_record"}},"created_at":"2026-05-17T23:49:06.525946+00:00","updated_at":"2026-05-17T23:49:06.525946+00:00"}