{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CAKP3Z5HCZTV4M2NRS6U4VARJQ","short_pith_number":"pith:CAKP3Z5H","schema_version":"1.0","canonical_sha256":"1014fde7a716675e334d8cbd4e54114c25cfd6d18d8982ac37a233c092c2895e","source":{"kind":"arxiv","id":"1902.05708","version":6},"attestation_state":"computed","paper":{"title":"Computing Minimal Presentations and Bigraded Betti Numbers of 2-Parameter Persistent Homology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.AC"],"primary_cat":"math.AT","authors_text":"Matthew Wright, Michael Lesnick","submitted_at":"2019-02-15T07:19:16Z","abstract_excerpt":"Motivated by applications to topological data analysis, we give an efficient algorithm for computing a (minimal) presentation of a bigraded $K[x,y]$-module $M$, where $K$ is a field. The algorithm takes as input a short chain complex of free modules $X\\xrightarrow{f} Y \\xrightarrow{g} Z$ such that $M\\cong \\ker{g}/\\mathrm{im}{f}$. It runs in time $O(|X|^3+|Y|^3+|Z|^3)$ and requires $O(|X|^2+|Y|^2+|Z|^2)$ memory, where $|\\cdot |$ denotes the rank. Given the presentation computed by our algorithm, the bigraded Betti numbers of $M$ are readily computed. Our approach is based on a simple matrix red"},"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":"1902.05708","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2019-02-15T07:19:16Z","cross_cats_sorted":["cs.SC","math.AC"],"title_canon_sha256":"15e7d20349678ad7b1a23bae1c550029ee4571e3d39a37d3b64fbbd998988ac9","abstract_canon_sha256":"9be4a0099f70b9d9620553fd120b765d1f785fef2adb48470c18c38067a9e38d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:24:53.198795Z","signature_b64":"BCow4vgXPTdcon0GXQ5fA0a943jKdHXEUeIpJGAGzyjuzVJS7QjeWiKP8L8DK8zEWuE4OrFBqFKcG3QnwJsZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1014fde7a716675e334d8cbd4e54114c25cfd6d18d8982ac37a233c092c2895e","last_reissued_at":"2026-07-05T04:24:53.198264Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:24:53.198264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Minimal Presentations and Bigraded Betti Numbers of 2-Parameter Persistent Homology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.AC"],"primary_cat":"math.AT","authors_text":"Matthew Wright, Michael Lesnick","submitted_at":"2019-02-15T07:19:16Z","abstract_excerpt":"Motivated by applications to topological data analysis, we give an efficient algorithm for computing a (minimal) presentation of a bigraded $K[x,y]$-module $M$, where $K$ is a field. The algorithm takes as input a short chain complex of free modules $X\\xrightarrow{f} Y \\xrightarrow{g} Z$ such that $M\\cong \\ker{g}/\\mathrm{im}{f}$. It runs in time $O(|X|^3+|Y|^3+|Z|^3)$ and requires $O(|X|^2+|Y|^2+|Z|^2)$ memory, where $|\\cdot |$ denotes the rank. Given the presentation computed by our algorithm, the bigraded Betti numbers of $M$ are readily computed. Our approach is based on a simple matrix red"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05708","kind":"arxiv","version":6},"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/1902.05708/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":"1902.05708","created_at":"2026-07-05T04:24:53.198329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.05708v6","created_at":"2026-07-05T04:24:53.198329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05708","created_at":"2026-07-05T04:24:53.198329+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAKP3Z5HCZTV","created_at":"2026-07-05T04:24:53.198329+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAKP3Z5HCZTV4M2N","created_at":"2026-07-05T04:24:53.198329+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAKP3Z5H","created_at":"2026-07-05T04:24:53.198329+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.23762","citing_title":"Path representations in multiparameter persistent homology","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CAKP3Z5HCZTV4M2NRS6U4VARJQ","json":"https://pith.science/pith/CAKP3Z5HCZTV4M2NRS6U4VARJQ.json","graph_json":"https://pith.science/api/pith-number/CAKP3Z5HCZTV4M2NRS6U4VARJQ/graph.json","events_json":"https://pith.science/api/pith-number/CAKP3Z5HCZTV4M2NRS6U4VARJQ/events.json","paper":"https://pith.science/paper/CAKP3Z5H"},"agent_actions":{"view_html":"https://pith.science/pith/CAKP3Z5HCZTV4M2NRS6U4VARJQ","download_json":"https://pith.science/pith/CAKP3Z5HCZTV4M2NRS6U4VARJQ.json","view_paper":"https://pith.science/paper/CAKP3Z5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.05708&json=true","fetch_graph":"https://pith.science/api/pith-number/CAKP3Z5HCZTV4M2NRS6U4VARJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/CAKP3Z5HCZTV4M2NRS6U4VARJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAKP3Z5HCZTV4M2NRS6U4VARJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAKP3Z5HCZTV4M2NRS6U4VARJQ/action/storage_attestation","attest_author":"https://pith.science/pith/CAKP3Z5HCZTV4M2NRS6U4VARJQ/action/author_attestation","sign_citation":"https://pith.science/pith/CAKP3Z5HCZTV4M2NRS6U4VARJQ/action/citation_signature","submit_replication":"https://pith.science/pith/CAKP3Z5HCZTV4M2NRS6U4VARJQ/action/replication_record"}},"created_at":"2026-07-05T04:24:53.198329+00:00","updated_at":"2026-07-05T04:24:53.198329+00:00"}