{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:GEYM3GL3REUDUNRXBO5SPJ6N7N","short_pith_number":"pith:GEYM3GL3","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"},"canonical_sha256":"3130cd997b89283a36370bbb27a7cdfb4fdbf32ad771393feb401fc20bb1bb55","source":{"kind":"arxiv","id":"2011.10978","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.10978","created_at":"2026-07-05T01:53:28Z"},{"alias_kind":"arxiv_version","alias_value":"2011.10978v1","created_at":"2026-07-05T01:53:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.10978","created_at":"2026-07-05T01:53:28Z"},{"alias_kind":"pith_short_12","alias_value":"GEYM3GL3REUD","created_at":"2026-07-05T01:53:28Z"},{"alias_kind":"pith_short_16","alias_value":"GEYM3GL3REUDUNRX","created_at":"2026-07-05T01:53:28Z"},{"alias_kind":"pith_short_8","alias_value":"GEYM3GL3","created_at":"2026-07-05T01:53:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:GEYM3GL3REUDUNRXBO5SPJ6N7N","target":"record","payload":{"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"},"canonical_sha256":"3130cd997b89283a36370bbb27a7cdfb4fdbf32ad771393feb401fc20bb1bb55","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"},"source_kind":"arxiv","source_id":"2011.10978","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:53:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bb0TfWS25ATowkvY3VBIOUUofRLDg/ltE9mj0JJC3J12GWlP3c4O/R32fq80nOpx8RECIl3E8VUArzPFeIG4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:12:56.025333Z"},"content_sha256":"cdfa72e79949b69a487557e34f7af124c7de23ecb4396a09afb1b8372d80292f","schema_version":"1.0","event_id":"sha256:cdfa72e79949b69a487557e34f7af124c7de23ecb4396a09afb1b8372d80292f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:GEYM3GL3REUDUNRXBO5SPJ6N7N","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:53:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BG09FnY+fRxt+ClGtXNIn5HqMNHWorCZTMx+Z6D9IwcZLfqiIhin6CIaAQW5u1fN+dqLvYCzy8qVyMnqjGyPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:12:56.025824Z"},"content_sha256":"e7ac47338507a28314296c39d4316db8294901be95a373e9b8d36ff2ba7c9f12","schema_version":"1.0","event_id":"sha256:e7ac47338507a28314296c39d4316db8294901be95a373e9b8d36ff2ba7c9f12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEYM3GL3REUDUNRXBO5SPJ6N7N/bundle.json","state_url":"https://pith.science/pith/GEYM3GL3REUDUNRXBO5SPJ6N7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEYM3GL3REUDUNRXBO5SPJ6N7N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-07T06:12:56Z","links":{"resolver":"https://pith.science/pith/GEYM3GL3REUDUNRXBO5SPJ6N7N","bundle":"https://pith.science/pith/GEYM3GL3REUDUNRXBO5SPJ6N7N/bundle.json","state":"https://pith.science/pith/GEYM3GL3REUDUNRXBO5SPJ6N7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEYM3GL3REUDUNRXBO5SPJ6N7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:GEYM3GL3REUDUNRXBO5SPJ6N7N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9d018db9c1fdc1dbee0e9f938cfb7878d25add5256cfa5bbf71352453c0e405e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2020-11-22T10:16:28Z","title_canon_sha256":"957f3fe196fb1d241a35577102440688bd1461e453acc0882580a93194194040"},"schema_version":"1.0","source":{"id":"2011.10978","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.10978","created_at":"2026-07-05T01:53:28Z"},{"alias_kind":"arxiv_version","alias_value":"2011.10978v1","created_at":"2026-07-05T01:53:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.10978","created_at":"2026-07-05T01:53:28Z"},{"alias_kind":"pith_short_12","alias_value":"GEYM3GL3REUD","created_at":"2026-07-05T01:53:28Z"},{"alias_kind":"pith_short_16","alias_value":"GEYM3GL3REUDUNRX","created_at":"2026-07-05T01:53:28Z"},{"alias_kind":"pith_short_8","alias_value":"GEYM3GL3","created_at":"2026-07-05T01:53:28Z"}],"graph_snapshots":[{"event_id":"sha256:e7ac47338507a28314296c39d4316db8294901be95a373e9b8d36ff2ba7c9f12","target":"graph","created_at":"2026-07-05T01:53:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.10978/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aditya Gulati, Rajat Mittal, Sayak Chakrabarti","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2020-11-22T10:16:28Z","title":"On algorithms to find p-ordering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.10978","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cdfa72e79949b69a487557e34f7af124c7de23ecb4396a09afb1b8372d80292f","target":"record","created_at":"2026-07-05T01:53:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9d018db9c1fdc1dbee0e9f938cfb7878d25add5256cfa5bbf71352453c0e405e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2020-11-22T10:16:28Z","title_canon_sha256":"957f3fe196fb1d241a35577102440688bd1461e453acc0882580a93194194040"},"schema_version":"1.0","source":{"id":"2011.10978","kind":"arxiv","version":1}},"canonical_sha256":"3130cd997b89283a36370bbb27a7cdfb4fdbf32ad771393feb401fc20bb1bb55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3130cd997b89283a36370bbb27a7cdfb4fdbf32ad771393feb401fc20bb1bb55","first_computed_at":"2026-07-05T01:53:28.194824Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:53:28.194824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o5CF0hrEHbXFDy1lzjemvIT5QgB7SC/gz5l/AWCA5rYPmHv05C7emIGsGrcmxBQdufvdmZX6Y2J4PR78dPvqBA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:53:28.195227Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.10978","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdfa72e79949b69a487557e34f7af124c7de23ecb4396a09afb1b8372d80292f","sha256:e7ac47338507a28314296c39d4316db8294901be95a373e9b8d36ff2ba7c9f12"],"state_sha256":"479d9c44c81e26be6ad7f4bcdc8b3de0ed43335f91a7b0112484d99f5e8f55ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NPYqeM6vGxrDfuOK1bOZoPydKf9Ctv2sQPSKJJwe1WK+NQlvnKDKyS4nWzvictISHeM6dYp86RtxHWufDOR/Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T06:12:56.029692Z","bundle_sha256":"2fc52b72e8c9417f06fcf174e709a584f3784831c3aa46b0bd36cee8cfc5e9ad"}}