{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YWL32WJQI2EPLTM4BSEM5UL4BD","short_pith_number":"pith:YWL32WJQ","canonical_record":{"source":{"id":"1204.1298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-04-05T18:25:59Z","cross_cats_sorted":["cs.CC","math.NT"],"title_canon_sha256":"d303d7da57ac3c60321b908b68fedc3174d042c9246a124989e549fe87856060","abstract_canon_sha256":"48980ab6c5a1ed5773a0c745ab627d49a689d79a0c6eca0d9bbe6e2edb7882be"},"schema_version":"1.0"},"canonical_sha256":"c597bd59304688f5cd9c0c88ced17c08c5d5c22d656acd3ff868993184fe4f82","source":{"kind":"arxiv","id":"1204.1298","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1298","created_at":"2026-05-18T03:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1298v1","created_at":"2026-05-18T03:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1298","created_at":"2026-05-18T03:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"YWL32WJQI2EP","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"YWL32WJQI2EPLTM4","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"YWL32WJQ","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YWL32WJQI2EPLTM4BSEM5UL4BD","target":"record","payload":{"canonical_record":{"source":{"id":"1204.1298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-04-05T18:25:59Z","cross_cats_sorted":["cs.CC","math.NT"],"title_canon_sha256":"d303d7da57ac3c60321b908b68fedc3174d042c9246a124989e549fe87856060","abstract_canon_sha256":"48980ab6c5a1ed5773a0c745ab627d49a689d79a0c6eca0d9bbe6e2edb7882be"},"schema_version":"1.0"},"canonical_sha256":"c597bd59304688f5cd9c0c88ced17c08c5d5c22d656acd3ff868993184fe4f82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:26.973845Z","signature_b64":"R+zlO2Fb28lkAvX6y6vWKJAczmeKHpJvqbvoVweEliPUfsFw5TfxR2aX0lxpjBrW64scEh6paC4CdcV5Q6NfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c597bd59304688f5cd9c0c88ced17c08c5d5c22d656acd3ff868993184fe4f82","last_reissued_at":"2026-05-18T03:58:26.973161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:26.973161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.1298","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-05-18T03:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPfl82BbIDQ+2nQqj0VsZX7YRISiH5f/RDu8dgSwwaSQ80dQmNk4dMqludRP94HAc5bELgu2+Tsu/HGWx2UYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T12:09:52.799677Z"},"content_sha256":"9f5590f2c1a7c8895d61f51adee06c2a2a92d361c51e6e6a3e7af2f1aeae53e2","schema_version":"1.0","event_id":"sha256:9f5590f2c1a7c8895d61f51adee06c2a2a92d361c51e6e6a3e7af2f1aeae53e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YWL32WJQI2EPLTM4BSEM5UL4BD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A polynomial time algorithm for computing the HNF of a module over the integers of a number field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.NT"],"primary_cat":"cs.SC","authors_text":"Claus Fieker, Jean-Fran\\c{c}ois Biasse","submitted_at":"2012-04-05T18:25:59Z","abstract_excerpt":"We present a variation of the modular algorithm for computing the Hermite Normal Form of an $\\OK$-module presented by Cohen, where $\\OK$ is the ring of integers of a number field K. The modular strategy was conjectured to run in polynomial time by Cohen, but so far, no such proof was available in the literature. In this paper, we provide a new method to prevent the coefficient explosion and we rigorously assess its complexity with respect to the size of the input and the invariants of the field K."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1298","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"},"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-05-18T03:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xTFR6TbGfxjm/YfXz6KpKFcqyzgLnnOBi4mzjz5ySdTS6t8VmbsB9DcEFjmE+YmgaCwZAPQoZ/KRs4SAG/VXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T12:09:52.800026Z"},"content_sha256":"daf16ee9eb420b47dcbc74ebaac9eb1b9733e8c0c9f2328fc0cb6e9592b9bd26","schema_version":"1.0","event_id":"sha256:daf16ee9eb420b47dcbc74ebaac9eb1b9733e8c0c9f2328fc0cb6e9592b9bd26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YWL32WJQI2EPLTM4BSEM5UL4BD/bundle.json","state_url":"https://pith.science/pith/YWL32WJQI2EPLTM4BSEM5UL4BD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YWL32WJQI2EPLTM4BSEM5UL4BD/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-06-24T12:09:52Z","links":{"resolver":"https://pith.science/pith/YWL32WJQI2EPLTM4BSEM5UL4BD","bundle":"https://pith.science/pith/YWL32WJQI2EPLTM4BSEM5UL4BD/bundle.json","state":"https://pith.science/pith/YWL32WJQI2EPLTM4BSEM5UL4BD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YWL32WJQI2EPLTM4BSEM5UL4BD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YWL32WJQI2EPLTM4BSEM5UL4BD","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":"48980ab6c5a1ed5773a0c745ab627d49a689d79a0c6eca0d9bbe6e2edb7882be","cross_cats_sorted":["cs.CC","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-04-05T18:25:59Z","title_canon_sha256":"d303d7da57ac3c60321b908b68fedc3174d042c9246a124989e549fe87856060"},"schema_version":"1.0","source":{"id":"1204.1298","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1298","created_at":"2026-05-18T03:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1298v1","created_at":"2026-05-18T03:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1298","created_at":"2026-05-18T03:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"YWL32WJQI2EP","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"YWL32WJQI2EPLTM4","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"YWL32WJQ","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:daf16ee9eb420b47dcbc74ebaac9eb1b9733e8c0c9f2328fc0cb6e9592b9bd26","target":"graph","created_at":"2026-05-18T03:58:26Z","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"},"paper":{"abstract_excerpt":"We present a variation of the modular algorithm for computing the Hermite Normal Form of an $\\OK$-module presented by Cohen, where $\\OK$ is the ring of integers of a number field K. The modular strategy was conjectured to run in polynomial time by Cohen, but so far, no such proof was available in the literature. In this paper, we provide a new method to prevent the coefficient explosion and we rigorously assess its complexity with respect to the size of the input and the invariants of the field K.","authors_text":"Claus Fieker, Jean-Fran\\c{c}ois Biasse","cross_cats":["cs.CC","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-04-05T18:25:59Z","title":"A polynomial time algorithm for computing the HNF of a module over the integers of a number field"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1298","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:9f5590f2c1a7c8895d61f51adee06c2a2a92d361c51e6e6a3e7af2f1aeae53e2","target":"record","created_at":"2026-05-18T03:58:26Z","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":"48980ab6c5a1ed5773a0c745ab627d49a689d79a0c6eca0d9bbe6e2edb7882be","cross_cats_sorted":["cs.CC","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-04-05T18:25:59Z","title_canon_sha256":"d303d7da57ac3c60321b908b68fedc3174d042c9246a124989e549fe87856060"},"schema_version":"1.0","source":{"id":"1204.1298","kind":"arxiv","version":1}},"canonical_sha256":"c597bd59304688f5cd9c0c88ced17c08c5d5c22d656acd3ff868993184fe4f82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c597bd59304688f5cd9c0c88ced17c08c5d5c22d656acd3ff868993184fe4f82","first_computed_at":"2026-05-18T03:58:26.973161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:26.973161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R+zlO2Fb28lkAvX6y6vWKJAczmeKHpJvqbvoVweEliPUfsFw5TfxR2aX0lxpjBrW64scEh6paC4CdcV5Q6NfDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:26.973845Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.1298","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f5590f2c1a7c8895d61f51adee06c2a2a92d361c51e6e6a3e7af2f1aeae53e2","sha256:daf16ee9eb420b47dcbc74ebaac9eb1b9733e8c0c9f2328fc0cb6e9592b9bd26"],"state_sha256":"186a4d21b778d133d9a10a06a40f05d1d000006a4eeaf628b9d58431d9d09d20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JcgwZc9nRxLkrnDlrgb27/f8hVge7tLM9KhbxJvH2PFz7yB0ibeEsI5QAzCrNUzP0KZ7UwAIlSJcQDKW/tGHCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T12:09:52.802006Z","bundle_sha256":"112bf446f6dc2675f949046b2e3272f7970ce092b33d3bda141eea4b77581518"}}