{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CAKP3Z5HCZTV4M2NRS6U4VARJQ","short_pith_number":"pith:CAKP3Z5H","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"},"canonical_sha256":"1014fde7a716675e334d8cbd4e54114c25cfd6d18d8982ac37a233c092c2895e","source":{"kind":"arxiv","id":"1902.05708","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05708","created_at":"2026-07-05T04:24:53Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05708v6","created_at":"2026-07-05T04:24:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05708","created_at":"2026-07-05T04:24:53Z"},{"alias_kind":"pith_short_12","alias_value":"CAKP3Z5HCZTV","created_at":"2026-07-05T04:24:53Z"},{"alias_kind":"pith_short_16","alias_value":"CAKP3Z5HCZTV4M2N","created_at":"2026-07-05T04:24:53Z"},{"alias_kind":"pith_short_8","alias_value":"CAKP3Z5H","created_at":"2026-07-05T04:24:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CAKP3Z5HCZTV4M2NRS6U4VARJQ","target":"record","payload":{"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"},"canonical_sha256":"1014fde7a716675e334d8cbd4e54114c25cfd6d18d8982ac37a233c092c2895e","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"},"source_kind":"arxiv","source_id":"1902.05708","source_version":6,"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-05T04:24:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SeAYuKtxesWUagJT98tWh+ZLylDjwpfAithFlMadbqXwr4Seefl5+ZQlKGtq9Mk/JaqTbOq8k2w6eruUez0jAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T01:13:35.385103Z"},"content_sha256":"f666103acd9c05607f49327878f8db4359d4cddd5baf38da8918d93f4b8f5e42","schema_version":"1.0","event_id":"sha256:f666103acd9c05607f49327878f8db4359d4cddd5baf38da8918d93f4b8f5e42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CAKP3Z5HCZTV4M2NRS6U4VARJQ","target":"graph","payload":{"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"},"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-05T04:24:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OkH/ezxuJ7d4vfgN3CwGW856Ubdhr5MLam/fq05etJfZLNe/nL34AZiyWKFnB/QIG8nGY9C02Zg+NvJJFu3oBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T01:13:35.385615Z"},"content_sha256":"54115afaedfa22c9e98effad053d72c6545fb10a75d26c1c34a0886792259cf6","schema_version":"1.0","event_id":"sha256:54115afaedfa22c9e98effad053d72c6545fb10a75d26c1c34a0886792259cf6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CAKP3Z5HCZTV4M2NRS6U4VARJQ/bundle.json","state_url":"https://pith.science/pith/CAKP3Z5HCZTV4M2NRS6U4VARJQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CAKP3Z5HCZTV4M2NRS6U4VARJQ/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-10T01:13:35Z","links":{"resolver":"https://pith.science/pith/CAKP3Z5HCZTV4M2NRS6U4VARJQ","bundle":"https://pith.science/pith/CAKP3Z5HCZTV4M2NRS6U4VARJQ/bundle.json","state":"https://pith.science/pith/CAKP3Z5HCZTV4M2NRS6U4VARJQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CAKP3Z5HCZTV4M2NRS6U4VARJQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CAKP3Z5HCZTV4M2NRS6U4VARJQ","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":"9be4a0099f70b9d9620553fd120b765d1f785fef2adb48470c18c38067a9e38d","cross_cats_sorted":["cs.SC","math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2019-02-15T07:19:16Z","title_canon_sha256":"15e7d20349678ad7b1a23bae1c550029ee4571e3d39a37d3b64fbbd998988ac9"},"schema_version":"1.0","source":{"id":"1902.05708","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05708","created_at":"2026-07-05T04:24:53Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05708v6","created_at":"2026-07-05T04:24:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05708","created_at":"2026-07-05T04:24:53Z"},{"alias_kind":"pith_short_12","alias_value":"CAKP3Z5HCZTV","created_at":"2026-07-05T04:24:53Z"},{"alias_kind":"pith_short_16","alias_value":"CAKP3Z5HCZTV4M2N","created_at":"2026-07-05T04:24:53Z"},{"alias_kind":"pith_short_8","alias_value":"CAKP3Z5H","created_at":"2026-07-05T04:24:53Z"}],"graph_snapshots":[{"event_id":"sha256:54115afaedfa22c9e98effad053d72c6545fb10a75d26c1c34a0886792259cf6","target":"graph","created_at":"2026-07-05T04:24:53Z","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/1902.05708/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Matthew Wright, Michael Lesnick","cross_cats":["cs.SC","math.AC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2019-02-15T07:19:16Z","title":"Computing Minimal Presentations and Bigraded Betti Numbers of 2-Parameter Persistent Homology"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05708","kind":"arxiv","version":6},"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:f666103acd9c05607f49327878f8db4359d4cddd5baf38da8918d93f4b8f5e42","target":"record","created_at":"2026-07-05T04:24:53Z","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":"9be4a0099f70b9d9620553fd120b765d1f785fef2adb48470c18c38067a9e38d","cross_cats_sorted":["cs.SC","math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2019-02-15T07:19:16Z","title_canon_sha256":"15e7d20349678ad7b1a23bae1c550029ee4571e3d39a37d3b64fbbd998988ac9"},"schema_version":"1.0","source":{"id":"1902.05708","kind":"arxiv","version":6}},"canonical_sha256":"1014fde7a716675e334d8cbd4e54114c25cfd6d18d8982ac37a233c092c2895e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1014fde7a716675e334d8cbd4e54114c25cfd6d18d8982ac37a233c092c2895e","first_computed_at":"2026-07-05T04:24:53.198264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:24:53.198264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BCow4vgXPTdcon0GXQ5fA0a943jKdHXEUeIpJGAGzyjuzVJS7QjeWiKP8L8DK8zEWuE4OrFBqFKcG3QnwJsZAA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:24:53.198795Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.05708","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f666103acd9c05607f49327878f8db4359d4cddd5baf38da8918d93f4b8f5e42","sha256:54115afaedfa22c9e98effad053d72c6545fb10a75d26c1c34a0886792259cf6"],"state_sha256":"d62bbdec7d79e362ae4dac19e4145f6942b2a85a2179b82979062b604dca8b0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aFBVsyz+HY198Ez0IFr20t1mgNmIM6a9gS7ILvT7n2sHlivsWNGP9Xkfwrrhge5LFWt+6eZGMwFKyrXDfH5jCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T01:13:35.390650Z","bundle_sha256":"3465b84bead15b4b89ed54be7eb58af45bd45f9f085d982645fa9045a16917cd"}}