{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:67OFQSB4MXDH2KJSALZVCDIHLD","short_pith_number":"pith:67OFQSB4","schema_version":"1.0","canonical_sha256":"f7dc58483c65c67d293202f3510d0758f8f00225dc126427074ae4a5417a6598","source":{"kind":"arxiv","id":"1507.00098","version":1},"attestation_state":"computed","paper":{"title":"A Generalization of Euler's Criterion to Composite Moduli","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"J\\'ozsef Vass","submitted_at":"2015-07-01T03:27:50Z","abstract_excerpt":"A necessary and sufficient condition is provided for the solvability of a binomial congruence with a composite modulus, circumventing its prime factorization. This is a generalization of Euler's Criterion through that of Euler's Theorem, and the concepts of order and primitive roots. Idempotent numbers play a central role in this effort."},"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":"1507.00098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-07-01T03:27:50Z","cross_cats_sorted":[],"title_canon_sha256":"a6b6f7c224bd5b6b9838928ad1359947231843792abb0f65663504ab5d1b3187","abstract_canon_sha256":"1dc9ed2424d51efb907b2c931e17f696267e49a430cd8fab8afb7ac25426dc14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:30.555733Z","signature_b64":"ZVNzloZSFp2V8F/Mtm1crZsgDlzdXYTa7Cv+z+1iy+y21jc9rnrFR4jAUWAyOiSrLwbA3HxTbMwqbqG8oSV5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7dc58483c65c67d293202f3510d0758f8f00225dc126427074ae4a5417a6598","last_reissued_at":"2026-05-18T01:37:30.554977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:30.554977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generalization of Euler's Criterion to Composite Moduli","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"J\\'ozsef Vass","submitted_at":"2015-07-01T03:27:50Z","abstract_excerpt":"A necessary and sufficient condition is provided for the solvability of a binomial congruence with a composite modulus, circumventing its prime factorization. This is a generalization of Euler's Criterion through that of Euler's Theorem, and the concepts of order and primitive roots. Idempotent numbers play a central role in this effort."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00098","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":"1507.00098","created_at":"2026-05-18T01:37:30.555112+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00098v1","created_at":"2026-05-18T01:37:30.555112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00098","created_at":"2026-05-18T01:37:30.555112+00:00"},{"alias_kind":"pith_short_12","alias_value":"67OFQSB4MXDH","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"67OFQSB4MXDH2KJS","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"67OFQSB4","created_at":"2026-05-18T12:29:07.941421+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/67OFQSB4MXDH2KJSALZVCDIHLD","json":"https://pith.science/pith/67OFQSB4MXDH2KJSALZVCDIHLD.json","graph_json":"https://pith.science/api/pith-number/67OFQSB4MXDH2KJSALZVCDIHLD/graph.json","events_json":"https://pith.science/api/pith-number/67OFQSB4MXDH2KJSALZVCDIHLD/events.json","paper":"https://pith.science/paper/67OFQSB4"},"agent_actions":{"view_html":"https://pith.science/pith/67OFQSB4MXDH2KJSALZVCDIHLD","download_json":"https://pith.science/pith/67OFQSB4MXDH2KJSALZVCDIHLD.json","view_paper":"https://pith.science/paper/67OFQSB4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00098&json=true","fetch_graph":"https://pith.science/api/pith-number/67OFQSB4MXDH2KJSALZVCDIHLD/graph.json","fetch_events":"https://pith.science/api/pith-number/67OFQSB4MXDH2KJSALZVCDIHLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67OFQSB4MXDH2KJSALZVCDIHLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67OFQSB4MXDH2KJSALZVCDIHLD/action/storage_attestation","attest_author":"https://pith.science/pith/67OFQSB4MXDH2KJSALZVCDIHLD/action/author_attestation","sign_citation":"https://pith.science/pith/67OFQSB4MXDH2KJSALZVCDIHLD/action/citation_signature","submit_replication":"https://pith.science/pith/67OFQSB4MXDH2KJSALZVCDIHLD/action/replication_record"}},"created_at":"2026-05-18T01:37:30.555112+00:00","updated_at":"2026-05-18T01:37:30.555112+00:00"}