{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:QLSQPA5UUZ2D6YPII2MFVDEKLP","short_pith_number":"pith:QLSQPA5U","schema_version":"1.0","canonical_sha256":"82e50783b4a6743f61e846985a8c8a5bf7def04d852264a1eb3915a470c8c647","source":{"kind":"arxiv","id":"math/0409489","version":1},"attestation_state":"computed","paper":{"title":"Non-Negative Integer Linear Congruences","license":"","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"David L. Wehlau, John C. Harris","submitted_at":"2004-09-24T22:03:47Z","abstract_excerpt":"We consider the problem of describing all non-negative integer solutions to a linear congruence in many variables. This question may be reduced to solving the congruence $x_1 + 2x_2 + 3x_3 + ... + (n-1)x_{n-1} \\equiv 0 \\pmod n$ where values of the unknowns, $x_i$, are sought among the non-negative integers. We consider the monoid of solutions of this equation and prove a conjecture of Elashvili concerning the structure of these solutions. This yields a simple algorithm for generating most (conjecturally all) of the high degree indecomposable solutions of the equation."},"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":"math/0409489","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.NT","submitted_at":"2004-09-24T22:03:47Z","cross_cats_sorted":[],"title_canon_sha256":"f1f9381124f367d9404fff46dfb1b1cc4218ae19a721e5449a2af237b90fc9cf","abstract_canon_sha256":"bb05f1181cc1f9c77d708bbac1d693658494c694180f8b67554ff35026bb7f0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:35.925539Z","signature_b64":"b8+seCsFuh44vajFlmbBF0pgSXHPNls6GdCEKvT4E8KauTx835mzOWOFGeWVjQuLqGp30j/7X/R5cdY5kx3IBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82e50783b4a6743f61e846985a8c8a5bf7def04d852264a1eb3915a470c8c647","last_reissued_at":"2026-05-18T03:55:35.925001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:35.925001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Negative Integer Linear Congruences","license":"","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"David L. Wehlau, John C. Harris","submitted_at":"2004-09-24T22:03:47Z","abstract_excerpt":"We consider the problem of describing all non-negative integer solutions to a linear congruence in many variables. This question may be reduced to solving the congruence $x_1 + 2x_2 + 3x_3 + ... + (n-1)x_{n-1} \\equiv 0 \\pmod n$ where values of the unknowns, $x_i$, are sought among the non-negative integers. We consider the monoid of solutions of this equation and prove a conjecture of Elashvili concerning the structure of these solutions. This yields a simple algorithm for generating most (conjecturally all) of the high degree indecomposable solutions of the equation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0409489","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":"math/0409489","created_at":"2026-05-18T03:55:35.925078+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0409489v1","created_at":"2026-05-18T03:55:35.925078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0409489","created_at":"2026-05-18T03:55:35.925078+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLSQPA5UUZ2D","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLSQPA5UUZ2D6YPI","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLSQPA5U","created_at":"2026-05-18T12:25:52.687210+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/QLSQPA5UUZ2D6YPII2MFVDEKLP","json":"https://pith.science/pith/QLSQPA5UUZ2D6YPII2MFVDEKLP.json","graph_json":"https://pith.science/api/pith-number/QLSQPA5UUZ2D6YPII2MFVDEKLP/graph.json","events_json":"https://pith.science/api/pith-number/QLSQPA5UUZ2D6YPII2MFVDEKLP/events.json","paper":"https://pith.science/paper/QLSQPA5U"},"agent_actions":{"view_html":"https://pith.science/pith/QLSQPA5UUZ2D6YPII2MFVDEKLP","download_json":"https://pith.science/pith/QLSQPA5UUZ2D6YPII2MFVDEKLP.json","view_paper":"https://pith.science/paper/QLSQPA5U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0409489&json=true","fetch_graph":"https://pith.science/api/pith-number/QLSQPA5UUZ2D6YPII2MFVDEKLP/graph.json","fetch_events":"https://pith.science/api/pith-number/QLSQPA5UUZ2D6YPII2MFVDEKLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLSQPA5UUZ2D6YPII2MFVDEKLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLSQPA5UUZ2D6YPII2MFVDEKLP/action/storage_attestation","attest_author":"https://pith.science/pith/QLSQPA5UUZ2D6YPII2MFVDEKLP/action/author_attestation","sign_citation":"https://pith.science/pith/QLSQPA5UUZ2D6YPII2MFVDEKLP/action/citation_signature","submit_replication":"https://pith.science/pith/QLSQPA5UUZ2D6YPII2MFVDEKLP/action/replication_record"}},"created_at":"2026-05-18T03:55:35.925078+00:00","updated_at":"2026-05-18T03:55:35.925078+00:00"}