{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XSLMXPXHUR3TTUXQ6KZNWIHZTD","short_pith_number":"pith:XSLMXPXH","canonical_record":{"source":{"id":"1706.10027","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2017-06-30T05:42:45Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"8df64addc1f85d5cf63671a118c0635c12cbb250355d2694090f0d03c65fac7a","abstract_canon_sha256":"afa17b344ff7352b2a5c60de657329af2312b95251b7e997bb3a3ce3771b3472"},"schema_version":"1.0"},"canonical_sha256":"bc96cbbee7a47739d2f0f2b2db20f998d08aaabffd1458642b355c7491265b7a","source":{"kind":"arxiv","id":"1706.10027","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.10027","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1706.10027v2","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.10027","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"XSLMXPXHUR3T","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XSLMXPXHUR3TTUXQ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XSLMXPXH","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XSLMXPXHUR3TTUXQ6KZNWIHZTD","target":"record","payload":{"canonical_record":{"source":{"id":"1706.10027","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2017-06-30T05:42:45Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"8df64addc1f85d5cf63671a118c0635c12cbb250355d2694090f0d03c65fac7a","abstract_canon_sha256":"afa17b344ff7352b2a5c60de657329af2312b95251b7e997bb3a3ce3771b3472"},"schema_version":"1.0"},"canonical_sha256":"bc96cbbee7a47739d2f0f2b2db20f998d08aaabffd1458642b355c7491265b7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:00.533527Z","signature_b64":"XY8LMaabtzH8thkc2yQE6BxYz4MBMryAt2yqq2nhYeIOMSsM1B0gYD5DyflWgCI7Z9+DjYtcRIZWuHEH5Ei4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc96cbbee7a47739d2f0f2b2db20f998d08aaabffd1458642b355c7491265b7a","last_reissued_at":"2026-05-18T00:05:00.533095Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:00.533095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.10027","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-18T00:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zibxw+D7FHO2+CVqD/pWkc8169up3ayKr06r/mu+Ouc1bV3qpmgabta2sbSJe5CaN1pcFUEvBy8+VAja4eBJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:58:24.989801Z"},"content_sha256":"dc577f936c687916581c5bfa65c116e5c4fc76a468c3b5161de2cea5435f4374","schema_version":"1.0","event_id":"sha256:dc577f936c687916581c5bfa65c116e5c4fc76a468c3b5161de2cea5435f4374"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XSLMXPXHUR3TTUXQ6KZNWIHZTD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix Method for Persistence Modules on Commutative Ladders of Finite Type","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.RT","authors_text":"Emerson G. Escolar, Hideto Asashiba, Hiroshi Takeuchi, Yasuaki Hiraoka","submitted_at":"2017-06-30T05:42:45Z","abstract_excerpt":"The theory of persistence modules on the commutative ladders $CL_n(\\tau)$ provides an extension of persistent homology. However, an efficient algorithm to compute the generalized persistence diagrams is still lacking. In this work, we view a persistence module $M$ on $CL_n(\\tau)$ as a morphism between zigzag modules, which can be expressed in a block matrix form. For the representation finite case ($n\\leq 4)$, we provide an algorithm that uses certain permissible row and column operations to compute a normal form of the block matrix. In this form an indecomposable decomposition of $M$, and thu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.10027","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-18T00:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JGPA0xigqDKmBFtvOxj9hesxPjFgivYtfwDG+9+1+OptFjOd4i7vTt6GEBtTU+v1RSFtmd//p4U8e+9hb915Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:58:24.990149Z"},"content_sha256":"1c03e75f4b0ec693c366c6c6e69a4f227eeeb8fd1ed5a97653443683e0b8103f","schema_version":"1.0","event_id":"sha256:1c03e75f4b0ec693c366c6c6e69a4f227eeeb8fd1ed5a97653443683e0b8103f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XSLMXPXHUR3TTUXQ6KZNWIHZTD/bundle.json","state_url":"https://pith.science/pith/XSLMXPXHUR3TTUXQ6KZNWIHZTD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XSLMXPXHUR3TTUXQ6KZNWIHZTD/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-20T05:58:24Z","links":{"resolver":"https://pith.science/pith/XSLMXPXHUR3TTUXQ6KZNWIHZTD","bundle":"https://pith.science/pith/XSLMXPXHUR3TTUXQ6KZNWIHZTD/bundle.json","state":"https://pith.science/pith/XSLMXPXHUR3TTUXQ6KZNWIHZTD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XSLMXPXHUR3TTUXQ6KZNWIHZTD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XSLMXPXHUR3TTUXQ6KZNWIHZTD","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":"afa17b344ff7352b2a5c60de657329af2312b95251b7e997bb3a3ce3771b3472","cross_cats_sorted":["math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2017-06-30T05:42:45Z","title_canon_sha256":"8df64addc1f85d5cf63671a118c0635c12cbb250355d2694090f0d03c65fac7a"},"schema_version":"1.0","source":{"id":"1706.10027","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.10027","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1706.10027v2","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.10027","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"XSLMXPXHUR3T","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XSLMXPXHUR3TTUXQ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XSLMXPXH","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:1c03e75f4b0ec693c366c6c6e69a4f227eeeb8fd1ed5a97653443683e0b8103f","target":"graph","created_at":"2026-05-18T00:05:00Z","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":"The theory of persistence modules on the commutative ladders $CL_n(\\tau)$ provides an extension of persistent homology. However, an efficient algorithm to compute the generalized persistence diagrams is still lacking. In this work, we view a persistence module $M$ on $CL_n(\\tau)$ as a morphism between zigzag modules, which can be expressed in a block matrix form. For the representation finite case ($n\\leq 4)$, we provide an algorithm that uses certain permissible row and column operations to compute a normal form of the block matrix. In this form an indecomposable decomposition of $M$, and thu","authors_text":"Emerson G. Escolar, Hideto Asashiba, Hiroshi Takeuchi, Yasuaki Hiraoka","cross_cats":["math.AT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2017-06-30T05:42:45Z","title":"Matrix Method for Persistence Modules on Commutative Ladders of Finite Type"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.10027","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:dc577f936c687916581c5bfa65c116e5c4fc76a468c3b5161de2cea5435f4374","target":"record","created_at":"2026-05-18T00:05:00Z","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":"afa17b344ff7352b2a5c60de657329af2312b95251b7e997bb3a3ce3771b3472","cross_cats_sorted":["math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2017-06-30T05:42:45Z","title_canon_sha256":"8df64addc1f85d5cf63671a118c0635c12cbb250355d2694090f0d03c65fac7a"},"schema_version":"1.0","source":{"id":"1706.10027","kind":"arxiv","version":2}},"canonical_sha256":"bc96cbbee7a47739d2f0f2b2db20f998d08aaabffd1458642b355c7491265b7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc96cbbee7a47739d2f0f2b2db20f998d08aaabffd1458642b355c7491265b7a","first_computed_at":"2026-05-18T00:05:00.533095Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:00.533095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XY8LMaabtzH8thkc2yQE6BxYz4MBMryAt2yqq2nhYeIOMSsM1B0gYD5DyflWgCI7Z9+DjYtcRIZWuHEH5Ei4Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:00.533527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.10027","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc577f936c687916581c5bfa65c116e5c4fc76a468c3b5161de2cea5435f4374","sha256:1c03e75f4b0ec693c366c6c6e69a4f227eeeb8fd1ed5a97653443683e0b8103f"],"state_sha256":"c32af2c939a907a2e3cd439ae079272de1f8cee28cbe82ba57c559f2d10e55a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BnIu78XUrBmJMbCZu9/S7qOX+cyq9pGinkHIOdnFVqurt6MsAVWxNP4nFlj22ktfJrpQ05Qhin5GWJmpgFD/Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:58:24.992076Z","bundle_sha256":"76319d66eeb29261b00589b6a76e202c07e3684264d461891dc682bec6def74c"}}