{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FBCHP7ZRLN5XBWQNWRHPVM3SR5","short_pith_number":"pith:FBCHP7ZR","canonical_record":{"source":{"id":"1210.1932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2012-10-06T08:40:00Z","cross_cats_sorted":["cs.CG","math.AC"],"title_canon_sha256":"40a501f1156201bba3420c7c91e19be463c8f6adcb7d4243b887ea8c36916c32","abstract_canon_sha256":"340ba6eb5de4f06fbf8007721e00d9018701c4cebb18b23b747205206d7e8e89"},"schema_version":"1.0"},"canonical_sha256":"284477ff315b7b70da0db44efab3728f626ca5366d0c19dc869d76299eba9a01","source":{"kind":"arxiv","id":"1210.1932","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1932","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1932v2","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1932","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"FBCHP7ZRLN5X","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"FBCHP7ZRLN5XBWQN","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"FBCHP7ZR","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FBCHP7ZRLN5XBWQNWRHPVM3SR5","target":"record","payload":{"canonical_record":{"source":{"id":"1210.1932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2012-10-06T08:40:00Z","cross_cats_sorted":["cs.CG","math.AC"],"title_canon_sha256":"40a501f1156201bba3420c7c91e19be463c8f6adcb7d4243b887ea8c36916c32","abstract_canon_sha256":"340ba6eb5de4f06fbf8007721e00d9018701c4cebb18b23b747205206d7e8e89"},"schema_version":"1.0"},"canonical_sha256":"284477ff315b7b70da0db44efab3728f626ca5366d0c19dc869d76299eba9a01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:04.620165Z","signature_b64":"xvNGmzGBcZfzFDqwrZ1DfflMsYlWRazWKMWeUBtHZSpx7mklvfTUnuwHzinmDZLw1txMTHpjYiZXv/OBiczECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"284477ff315b7b70da0db44efab3728f626ca5366d0c19dc869d76299eba9a01","last_reissued_at":"2026-05-18T01:24:04.619422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:04.619422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.1932","source_version":2,"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-18T01:24:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FhIeUnR0ge3a3PKW7Ah0qIjHm7tyhylpOrHpdpt++i2Y2oOOR8nkvPRd1sd1zF9Oc6eCd9v08vnvYzWqhJaLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:13:55.761329Z"},"content_sha256":"6b2beee0a77d034e3e96b204f81b52eff90daa070ff7c0fa61c89ff283411229","schema_version":"1.0","event_id":"sha256:6b2beee0a77d034e3e96b204f81b52eff90daa070ff7c0fa61c89ff283411229"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FBCHP7ZRLN5XBWQNWRHPVM3SR5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A presentation of general multipersistence modules computable in polynomial time?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.AC"],"primary_cat":"math.AT","authors_text":"Antonio Patriarca, Francesco Vaccarino, Martina Scolamiero","submitted_at":"2012-10-06T08:40:00Z","abstract_excerpt":"Multipersistence homology modules were introduced by G.Carlsson and A.Zomorodian which gave, together with G.Singh, an algorithm to compute their Groebner bases. Although their algorithm has polynomial complexity when the chain modules are free, i.e. in the one-critical case, it might be exponential in general. We give a new presentation of multipersistence homology modules, which allows us to design an algorithm to compute their Groebner bases always in polynomial time by avoiding the mapping telescope."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1932","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"},"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-18T01:24:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QJ/ky1VubWujo4Dvy+DVNggZof8ZLF7/xsP7lRkMdlTd2FP8zoyYsfab3Ds4HWcrPSqZbrjiXu7DX/q9vHXbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:13:55.761710Z"},"content_sha256":"9b867dbdddfc3f0911d17a27de94dbaee545d328b6b915bb68935931bd5ce5ef","schema_version":"1.0","event_id":"sha256:9b867dbdddfc3f0911d17a27de94dbaee545d328b6b915bb68935931bd5ce5ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FBCHP7ZRLN5XBWQNWRHPVM3SR5/bundle.json","state_url":"https://pith.science/pith/FBCHP7ZRLN5XBWQNWRHPVM3SR5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FBCHP7ZRLN5XBWQNWRHPVM3SR5/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-05-30T04:13:55Z","links":{"resolver":"https://pith.science/pith/FBCHP7ZRLN5XBWQNWRHPVM3SR5","bundle":"https://pith.science/pith/FBCHP7ZRLN5XBWQNWRHPVM3SR5/bundle.json","state":"https://pith.science/pith/FBCHP7ZRLN5XBWQNWRHPVM3SR5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FBCHP7ZRLN5XBWQNWRHPVM3SR5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FBCHP7ZRLN5XBWQNWRHPVM3SR5","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":"340ba6eb5de4f06fbf8007721e00d9018701c4cebb18b23b747205206d7e8e89","cross_cats_sorted":["cs.CG","math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2012-10-06T08:40:00Z","title_canon_sha256":"40a501f1156201bba3420c7c91e19be463c8f6adcb7d4243b887ea8c36916c32"},"schema_version":"1.0","source":{"id":"1210.1932","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1932","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1932v2","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1932","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"FBCHP7ZRLN5X","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"FBCHP7ZRLN5XBWQN","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"FBCHP7ZR","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:9b867dbdddfc3f0911d17a27de94dbaee545d328b6b915bb68935931bd5ce5ef","target":"graph","created_at":"2026-05-18T01:24:04Z","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":"Multipersistence homology modules were introduced by G.Carlsson and A.Zomorodian which gave, together with G.Singh, an algorithm to compute their Groebner bases. Although their algorithm has polynomial complexity when the chain modules are free, i.e. in the one-critical case, it might be exponential in general. We give a new presentation of multipersistence homology modules, which allows us to design an algorithm to compute their Groebner bases always in polynomial time by avoiding the mapping telescope.","authors_text":"Antonio Patriarca, Francesco Vaccarino, Martina Scolamiero","cross_cats":["cs.CG","math.AC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2012-10-06T08:40:00Z","title":"A presentation of general multipersistence modules computable in polynomial time?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1932","kind":"arxiv","version":2},"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:6b2beee0a77d034e3e96b204f81b52eff90daa070ff7c0fa61c89ff283411229","target":"record","created_at":"2026-05-18T01:24:04Z","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":"340ba6eb5de4f06fbf8007721e00d9018701c4cebb18b23b747205206d7e8e89","cross_cats_sorted":["cs.CG","math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2012-10-06T08:40:00Z","title_canon_sha256":"40a501f1156201bba3420c7c91e19be463c8f6adcb7d4243b887ea8c36916c32"},"schema_version":"1.0","source":{"id":"1210.1932","kind":"arxiv","version":2}},"canonical_sha256":"284477ff315b7b70da0db44efab3728f626ca5366d0c19dc869d76299eba9a01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"284477ff315b7b70da0db44efab3728f626ca5366d0c19dc869d76299eba9a01","first_computed_at":"2026-05-18T01:24:04.619422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:04.619422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xvNGmzGBcZfzFDqwrZ1DfflMsYlWRazWKMWeUBtHZSpx7mklvfTUnuwHzinmDZLw1txMTHpjYiZXv/OBiczECw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:04.620165Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.1932","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b2beee0a77d034e3e96b204f81b52eff90daa070ff7c0fa61c89ff283411229","sha256:9b867dbdddfc3f0911d17a27de94dbaee545d328b6b915bb68935931bd5ce5ef"],"state_sha256":"9d796c362b1aab69f0856d9cef729a99941fd08b62b30bb9c20b4d828cfa27f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UgRJNRw2sZEzqGOWCuu/dn5UER1oPMq2vNBQMFGyGWkgH4e4A0Y+JzRXqWPt57d8U455+SN4/r4SqYipROmYAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:13:55.765259Z","bundle_sha256":"bba7d6bfdadaffc0f9a353319849a2ba31dd19755b673b669e2fae53b066c913"}}