{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XY75SFRQQOSBICIZ2LZHTX5TOP","short_pith_number":"pith:XY75SFRQ","schema_version":"1.0","canonical_sha256":"be3fd9163083a4140919d2f279dfb373e9fb81a04c95656d3045d5600e5bb317","source":{"kind":"arxiv","id":"1408.5515","version":2},"attestation_state":"computed","paper":{"title":"On primary decomposition of modules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Afshan Sadiq, Asifa Tassaddiq, Nazeran Idrees","submitted_at":"2014-08-23T17:23:41Z","abstract_excerpt":"Primary decomposition is a very important tool of commutative algebra and geometry. In this paper we generalized some of the existing algorithms of primary decomposition developed by Eisenbud et al. (cf. [EHV]) for free modules and also filled some gaps by providing proofs of important theorems(2.9, 2.12, 2.13) appeared in [EHV]. All these algorithms are programmed and implemented in {\\sc Singular}."},"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":"1408.5515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2014-08-23T17:23:41Z","cross_cats_sorted":[],"title_canon_sha256":"6e6de30cddcc6f3395dee7905f6e3ab56cb3147caf01704a4fbc37071a11386b","abstract_canon_sha256":"0c70c5ead3af5a70802d14f0962824b5fe601593e0037973d726deb78158f32f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:46.666482Z","signature_b64":"eYIfF7OUWKACp446ku0mu5Bl5jtWxXsVq/12/FaOs7Hh/z7LLSHWXK9xwfj8DlcER+uUOSoLJgdQT7I2aVIxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be3fd9163083a4140919d2f279dfb373e9fb81a04c95656d3045d5600e5bb317","last_reissued_at":"2026-05-18T02:43:46.665917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:46.665917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On primary decomposition of modules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Afshan Sadiq, Asifa Tassaddiq, Nazeran Idrees","submitted_at":"2014-08-23T17:23:41Z","abstract_excerpt":"Primary decomposition is a very important tool of commutative algebra and geometry. In this paper we generalized some of the existing algorithms of primary decomposition developed by Eisenbud et al. (cf. [EHV]) for free modules and also filled some gaps by providing proofs of important theorems(2.9, 2.12, 2.13) appeared in [EHV]. All these algorithms are programmed and implemented in {\\sc Singular}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5515","kind":"arxiv","version":2},"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":"1408.5515","created_at":"2026-05-18T02:43:46.665997+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.5515v2","created_at":"2026-05-18T02:43:46.665997+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5515","created_at":"2026-05-18T02:43:46.665997+00:00"},{"alias_kind":"pith_short_12","alias_value":"XY75SFRQQOSB","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XY75SFRQQOSBICIZ","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XY75SFRQ","created_at":"2026-05-18T12:28:57.508820+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/XY75SFRQQOSBICIZ2LZHTX5TOP","json":"https://pith.science/pith/XY75SFRQQOSBICIZ2LZHTX5TOP.json","graph_json":"https://pith.science/api/pith-number/XY75SFRQQOSBICIZ2LZHTX5TOP/graph.json","events_json":"https://pith.science/api/pith-number/XY75SFRQQOSBICIZ2LZHTX5TOP/events.json","paper":"https://pith.science/paper/XY75SFRQ"},"agent_actions":{"view_html":"https://pith.science/pith/XY75SFRQQOSBICIZ2LZHTX5TOP","download_json":"https://pith.science/pith/XY75SFRQQOSBICIZ2LZHTX5TOP.json","view_paper":"https://pith.science/paper/XY75SFRQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.5515&json=true","fetch_graph":"https://pith.science/api/pith-number/XY75SFRQQOSBICIZ2LZHTX5TOP/graph.json","fetch_events":"https://pith.science/api/pith-number/XY75SFRQQOSBICIZ2LZHTX5TOP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XY75SFRQQOSBICIZ2LZHTX5TOP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XY75SFRQQOSBICIZ2LZHTX5TOP/action/storage_attestation","attest_author":"https://pith.science/pith/XY75SFRQQOSBICIZ2LZHTX5TOP/action/author_attestation","sign_citation":"https://pith.science/pith/XY75SFRQQOSBICIZ2LZHTX5TOP/action/citation_signature","submit_replication":"https://pith.science/pith/XY75SFRQQOSBICIZ2LZHTX5TOP/action/replication_record"}},"created_at":"2026-05-18T02:43:46.665997+00:00","updated_at":"2026-05-18T02:43:46.665997+00:00"}