{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DXA56PUYICD6WL4FC47ZYQ5LY3","short_pith_number":"pith:DXA56PUY","schema_version":"1.0","canonical_sha256":"1dc1df3e984087eb2f85173f9c43abc6dfc9b43a0fa62fc9bdfa5b93b65b7bf6","source":{"kind":"arxiv","id":"2411.11594","version":6},"attestation_state":"computed","paper":{"title":"Interval Multiplicities of Persistence Modules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","math.RA"],"primary_cat":"math.RT","authors_text":"2, (2) Osaka Central Advanced Mathematical Institute, 3), (3) Institute for Advanced Study, Enhao Liu (3) ((1) Department of Mathematics, Hideto Asashiba (1, Kyoto University), Osaka Metropolitan University, Shizuoka University","submitted_at":"2024-11-18T14:15:30Z","abstract_excerpt":"For any persistence module $M$ over a finite poset $\\mathbf{P}$, and any interval $I$ of $\\mathbf{P}$, we give a formula for the multiplicity $d_M(V_I)$ of the interval module $V_I$ in the indecomposable decomposition of $M$ in terms of the ranks of matrices consisting of structure linear maps of $M$. This generalizes the corresponding formula for 1-dimensional persistence modules. As applications, the formula enables us to compute the maximal interval-decomposable direct summand of $M$, to decide whether $M$ is interval-decomposable, and to detect properties determined by prescribed interval "},"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":"2411.11594","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2024-11-18T14:15:30Z","cross_cats_sorted":["math.AT","math.RA"],"title_canon_sha256":"aad0ecc8f81fde5a429f1ccd543bb7db18cf9340e4046e8bc3442c062c818b7c","abstract_canon_sha256":"30eeb70df33676a1632f5aa6c0660bb39226f402fea47bb8360dc6764602797c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:03:47.414709Z","signature_b64":"s7CLXdIMunRzCgFkHOIcfCRrUsZg0G+X0d2gDSiq25RVYfcXW1VlopvNSjm1Qe8R5ZScapEm6LlXyB+apGWyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dc1df3e984087eb2f85173f9c43abc6dfc9b43a0fa62fc9bdfa5b93b65b7bf6","last_reissued_at":"2026-05-26T02:03:47.413867Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:03:47.413867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interval Multiplicities of Persistence Modules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","math.RA"],"primary_cat":"math.RT","authors_text":"2, (2) Osaka Central Advanced Mathematical Institute, 3), (3) Institute for Advanced Study, Enhao Liu (3) ((1) Department of Mathematics, Hideto Asashiba (1, Kyoto University), Osaka Metropolitan University, Shizuoka University","submitted_at":"2024-11-18T14:15:30Z","abstract_excerpt":"For any persistence module $M$ over a finite poset $\\mathbf{P}$, and any interval $I$ of $\\mathbf{P}$, we give a formula for the multiplicity $d_M(V_I)$ of the interval module $V_I$ in the indecomposable decomposition of $M$ in terms of the ranks of matrices consisting of structure linear maps of $M$. This generalizes the corresponding formula for 1-dimensional persistence modules. As applications, the formula enables us to compute the maximal interval-decomposable direct summand of $M$, to decide whether $M$ is interval-decomposable, and to detect properties determined by prescribed interval "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.11594","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/2411.11594/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":"2411.11594","created_at":"2026-05-26T02:03:47.413976+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.11594v6","created_at":"2026-05-26T02:03:47.413976+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.11594","created_at":"2026-05-26T02:03:47.413976+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXA56PUYICD6","created_at":"2026-05-26T02:03:47.413976+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXA56PUYICD6WL4F","created_at":"2026-05-26T02:03:47.413976+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXA56PUY","created_at":"2026-05-26T02:03:47.413976+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/DXA56PUYICD6WL4FC47ZYQ5LY3","json":"https://pith.science/pith/DXA56PUYICD6WL4FC47ZYQ5LY3.json","graph_json":"https://pith.science/api/pith-number/DXA56PUYICD6WL4FC47ZYQ5LY3/graph.json","events_json":"https://pith.science/api/pith-number/DXA56PUYICD6WL4FC47ZYQ5LY3/events.json","paper":"https://pith.science/paper/DXA56PUY"},"agent_actions":{"view_html":"https://pith.science/pith/DXA56PUYICD6WL4FC47ZYQ5LY3","download_json":"https://pith.science/pith/DXA56PUYICD6WL4FC47ZYQ5LY3.json","view_paper":"https://pith.science/paper/DXA56PUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.11594&json=true","fetch_graph":"https://pith.science/api/pith-number/DXA56PUYICD6WL4FC47ZYQ5LY3/graph.json","fetch_events":"https://pith.science/api/pith-number/DXA56PUYICD6WL4FC47ZYQ5LY3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXA56PUYICD6WL4FC47ZYQ5LY3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXA56PUYICD6WL4FC47ZYQ5LY3/action/storage_attestation","attest_author":"https://pith.science/pith/DXA56PUYICD6WL4FC47ZYQ5LY3/action/author_attestation","sign_citation":"https://pith.science/pith/DXA56PUYICD6WL4FC47ZYQ5LY3/action/citation_signature","submit_replication":"https://pith.science/pith/DXA56PUYICD6WL4FC47ZYQ5LY3/action/replication_record"}},"created_at":"2026-05-26T02:03:47.413976+00:00","updated_at":"2026-05-26T02:03:47.413976+00:00"}