{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YLACMVVRIYBDIPYPAL7RUFWFQ7","short_pith_number":"pith:YLACMVVR","schema_version":"1.0","canonical_sha256":"c2c02656b14602343f0f02ff1a16c587f06184bf1614c426e615cce5025fbdbc","source":{"kind":"arxiv","id":"1610.09280","version":1},"attestation_state":"computed","paper":{"title":"On Composite Moduli from the Viewpoint of Idempotent Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"J\\'ozsef Vass","submitted_at":"2016-10-27T03:50:47Z","abstract_excerpt":"The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called idempotent numbers, that is unavoidable when researching composite moduli. Among many interesting results, we give generalizations of well-known theorems and definitions, such as the Euler-Fermat Theorem and the concept of primitive roots. We consider the generalization of the equivalence condition for the solvability of a binomial congruence to be the main resul"},"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":"1610.09280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2016-10-27T03:50:47Z","cross_cats_sorted":[],"title_canon_sha256":"62759dba72338a2afdfe0d4452d8e8e09b012327ee2a8c3e27fb96a22f79bb68","abstract_canon_sha256":"9c38da70e82fd8c8848c203321dd536bfaab051d0927a6ab855a1c929b1b6a44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:58.559279Z","signature_b64":"9DvVW9HLPi8/hscUNZ0KGIJbUjS9Ms74iir5wj1H1fPLW+JUb/KkybRN0v1B3HAkOWeOwYckCPFE+3DIw2thBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2c02656b14602343f0f02ff1a16c587f06184bf1614c426e615cce5025fbdbc","last_reissued_at":"2026-05-18T01:00:58.558558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:58.558558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Composite Moduli from the Viewpoint of Idempotent Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"J\\'ozsef Vass","submitted_at":"2016-10-27T03:50:47Z","abstract_excerpt":"The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called idempotent numbers, that is unavoidable when researching composite moduli. Among many interesting results, we give generalizations of well-known theorems and definitions, such as the Euler-Fermat Theorem and the concept of primitive roots. We consider the generalization of the equivalence condition for the solvability of a binomial congruence to be the main resul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09280","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":"1610.09280","created_at":"2026-05-18T01:00:58.558671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.09280v1","created_at":"2026-05-18T01:00:58.558671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09280","created_at":"2026-05-18T01:00:58.558671+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLACMVVRIYBD","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLACMVVRIYBDIPYP","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLACMVVR","created_at":"2026-05-18T12:30:53.716459+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/YLACMVVRIYBDIPYPAL7RUFWFQ7","json":"https://pith.science/pith/YLACMVVRIYBDIPYPAL7RUFWFQ7.json","graph_json":"https://pith.science/api/pith-number/YLACMVVRIYBDIPYPAL7RUFWFQ7/graph.json","events_json":"https://pith.science/api/pith-number/YLACMVVRIYBDIPYPAL7RUFWFQ7/events.json","paper":"https://pith.science/paper/YLACMVVR"},"agent_actions":{"view_html":"https://pith.science/pith/YLACMVVRIYBDIPYPAL7RUFWFQ7","download_json":"https://pith.science/pith/YLACMVVRIYBDIPYPAL7RUFWFQ7.json","view_paper":"https://pith.science/paper/YLACMVVR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.09280&json=true","fetch_graph":"https://pith.science/api/pith-number/YLACMVVRIYBDIPYPAL7RUFWFQ7/graph.json","fetch_events":"https://pith.science/api/pith-number/YLACMVVRIYBDIPYPAL7RUFWFQ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLACMVVRIYBDIPYPAL7RUFWFQ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLACMVVRIYBDIPYPAL7RUFWFQ7/action/storage_attestation","attest_author":"https://pith.science/pith/YLACMVVRIYBDIPYPAL7RUFWFQ7/action/author_attestation","sign_citation":"https://pith.science/pith/YLACMVVRIYBDIPYPAL7RUFWFQ7/action/citation_signature","submit_replication":"https://pith.science/pith/YLACMVVRIYBDIPYPAL7RUFWFQ7/action/replication_record"}},"created_at":"2026-05-18T01:00:58.558671+00:00","updated_at":"2026-05-18T01:00:58.558671+00:00"}