{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GEYM3GL3REUDUNRXBO5SPJ6N7N","short_pith_number":"pith:GEYM3GL3","schema_version":"1.0","canonical_sha256":"3130cd997b89283a36370bbb27a7cdfb4fdbf32ad771393feb401fc20bb1bb55","source":{"kind":"arxiv","id":"2011.10978","version":1},"attestation_state":"computed","paper":{"title":"On algorithms to find p-ordering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.NT","authors_text":"Aditya Gulati, Rajat Mittal, Sayak Chakrabarti","submitted_at":"2020-11-22T10:16:28Z","abstract_excerpt":"The concept of p-ordering for a prime p was introduced by Manjul Bhargava (in his PhD thesis) to develop a generalized factorial function over an arbitrary subset of integers. This notion of p-ordering provides a representation of polynomials modulo prime powers, and has been used to prove properties of roots sets modulo prime powers. We focus on the complexity of finding a p-ordering given a prime p, an exponent k and a subset of integers modulo p^k.\n  Our first algorithm gives a p-ordering for set of size n in time O(nk\\log p), where set is considered modulo p^k. The subsets modulo p^k can b"},"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":"2011.10978","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2020-11-22T10:16:28Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"957f3fe196fb1d241a35577102440688bd1461e453acc0882580a93194194040","abstract_canon_sha256":"9d018db9c1fdc1dbee0e9f938cfb7878d25add5256cfa5bbf71352453c0e405e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:53:28.195227Z","signature_b64":"o5CF0hrEHbXFDy1lzjemvIT5QgB7SC/gz5l/AWCA5rYPmHv05C7emIGsGrcmxBQdufvdmZX6Y2J4PR78dPvqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3130cd997b89283a36370bbb27a7cdfb4fdbf32ad771393feb401fc20bb1bb55","last_reissued_at":"2026-07-05T01:53:28.194824Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:53:28.194824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On algorithms to find p-ordering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.NT","authors_text":"Aditya Gulati, Rajat Mittal, Sayak Chakrabarti","submitted_at":"2020-11-22T10:16:28Z","abstract_excerpt":"The concept of p-ordering for a prime p was introduced by Manjul Bhargava (in his PhD thesis) to develop a generalized factorial function over an arbitrary subset of integers. This notion of p-ordering provides a representation of polynomials modulo prime powers, and has been used to prove properties of roots sets modulo prime powers. We focus on the complexity of finding a p-ordering given a prime p, an exponent k and a subset of integers modulo p^k.\n  Our first algorithm gives a p-ordering for set of size n in time O(nk\\log p), where set is considered modulo p^k. The subsets modulo p^k can b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.10978","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.10978/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.10978","created_at":"2026-07-05T01:53:28.194879+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.10978v1","created_at":"2026-07-05T01:53:28.194879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.10978","created_at":"2026-07-05T01:53:28.194879+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEYM3GL3REUD","created_at":"2026-07-05T01:53:28.194879+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEYM3GL3REUDUNRX","created_at":"2026-07-05T01:53:28.194879+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEYM3GL3","created_at":"2026-07-05T01:53:28.194879+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/GEYM3GL3REUDUNRXBO5SPJ6N7N","json":"https://pith.science/pith/GEYM3GL3REUDUNRXBO5SPJ6N7N.json","graph_json":"https://pith.science/api/pith-number/GEYM3GL3REUDUNRXBO5SPJ6N7N/graph.json","events_json":"https://pith.science/api/pith-number/GEYM3GL3REUDUNRXBO5SPJ6N7N/events.json","paper":"https://pith.science/paper/GEYM3GL3"},"agent_actions":{"view_html":"https://pith.science/pith/GEYM3GL3REUDUNRXBO5SPJ6N7N","download_json":"https://pith.science/pith/GEYM3GL3REUDUNRXBO5SPJ6N7N.json","view_paper":"https://pith.science/paper/GEYM3GL3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.10978&json=true","fetch_graph":"https://pith.science/api/pith-number/GEYM3GL3REUDUNRXBO5SPJ6N7N/graph.json","fetch_events":"https://pith.science/api/pith-number/GEYM3GL3REUDUNRXBO5SPJ6N7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEYM3GL3REUDUNRXBO5SPJ6N7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEYM3GL3REUDUNRXBO5SPJ6N7N/action/storage_attestation","attest_author":"https://pith.science/pith/GEYM3GL3REUDUNRXBO5SPJ6N7N/action/author_attestation","sign_citation":"https://pith.science/pith/GEYM3GL3REUDUNRXBO5SPJ6N7N/action/citation_signature","submit_replication":"https://pith.science/pith/GEYM3GL3REUDUNRXBO5SPJ6N7N/action/replication_record"}},"created_at":"2026-07-05T01:53:28.194879+00:00","updated_at":"2026-07-05T01:53:28.194879+00:00"}