{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YTOU2JV3CLZWVDMFL3B45IZWPO","short_pith_number":"pith:YTOU2JV3","canonical_record":{"source":{"id":"1404.0644","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-02T18:10:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c632cf92ee78950a4cbe5b263174fc9b8b7bf60171f854cef66bb0a6091df4d1","abstract_canon_sha256":"55359101d81d7da61f6c74b7f2ab88c8c8f878a6808a370d35ca2c8dfff2f3de"},"schema_version":"1.0"},"canonical_sha256":"c4dd4d26bb12f36a8d855ec3cea3367b830884bbe142abf2df5cd4249a8a7d3a","source":{"kind":"arxiv","id":"1404.0644","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0644","created_at":"2026-05-18T02:43:26Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0644v3","created_at":"2026-05-18T02:43:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0644","created_at":"2026-05-18T02:43:26Z"},{"alias_kind":"pith_short_12","alias_value":"YTOU2JV3CLZW","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YTOU2JV3CLZWVDMF","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YTOU2JV3","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YTOU2JV3CLZWVDMFL3B45IZWPO","target":"record","payload":{"canonical_record":{"source":{"id":"1404.0644","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-02T18:10:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c632cf92ee78950a4cbe5b263174fc9b8b7bf60171f854cef66bb0a6091df4d1","abstract_canon_sha256":"55359101d81d7da61f6c74b7f2ab88c8c8f878a6808a370d35ca2c8dfff2f3de"},"schema_version":"1.0"},"canonical_sha256":"c4dd4d26bb12f36a8d855ec3cea3367b830884bbe142abf2df5cd4249a8a7d3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:26.017969Z","signature_b64":"F1rDdZxOSd2ZAVkeCHExRQ0NRY+v012y5kriITtFe/QlwMfIY2NRXxOvwsf81xK6Tnle+U0Luz1hknGcfLWtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4dd4d26bb12f36a8d855ec3cea3367b830884bbe142abf2df5cd4249a8a7d3a","last_reissued_at":"2026-05-18T02:43:26.017245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:26.017245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.0644","source_version":3,"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-18T02:43:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2k9jWx81x4kQHhNrvSgmYBNg/5SQFR5xEdY9Qs2v4+IDlt//23XqUrrrEOk3A2UYfgRuckCSJ+/FeWns82hZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:54:50.071291Z"},"content_sha256":"6c256f03602c4401fcffb5ba0927eadfe846a55f3f4898fe302382a6f9222f8d","schema_version":"1.0","event_id":"sha256:6c256f03602c4401fcffb5ba0927eadfe846a55f3f4898fe302382a6f9222f8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YTOU2JV3CLZWVDMFL3B45IZWPO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tighter Undecidability Bounds for Matrix Mortality, Zero-in-the-Corner Problems, and More","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Francois Nicolas, Julien Cassaigne, Tero Harju, Vesa Halava","submitted_at":"2014-04-02T18:10:40Z","abstract_excerpt":"We study the decidability of three well-known problems related to integer matrix multiplication: Mortality (M), Zero in the Left-Upper Corner (Z), and Zero in the Right-Upper Corner (R).\n  Let d and k be positive integers. Define M(k, d x d) as the following special case of the Mortality problem: given a set X of d -by-d integer matrices such that the cardinality of X is not greater than k, decide whether the d-by-d zero matrix belongs to X^+, where X^+ denotes the closure of X under the usual matrix multiplication. In the same way, define the Z(k, d x d) problem as: given an instance X of M(k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0644","kind":"arxiv","version":3},"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-18T02:43:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FRwDgmOiBetRNW6Dbd8F6mXU7SDZBxn+md+q4laWnoM1x74GIJtt/GYzKHKpKVLTJoI/yjocJSumCxT6VB50CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:54:50.071969Z"},"content_sha256":"44eb0c79216a2c4b9c12d240709c3db78ad4e610c65b7a21836689697411b3a1","schema_version":"1.0","event_id":"sha256:44eb0c79216a2c4b9c12d240709c3db78ad4e610c65b7a21836689697411b3a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YTOU2JV3CLZWVDMFL3B45IZWPO/bundle.json","state_url":"https://pith.science/pith/YTOU2JV3CLZWVDMFL3B45IZWPO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YTOU2JV3CLZWVDMFL3B45IZWPO/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-26T17:54:50Z","links":{"resolver":"https://pith.science/pith/YTOU2JV3CLZWVDMFL3B45IZWPO","bundle":"https://pith.science/pith/YTOU2JV3CLZWVDMFL3B45IZWPO/bundle.json","state":"https://pith.science/pith/YTOU2JV3CLZWVDMFL3B45IZWPO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YTOU2JV3CLZWVDMFL3B45IZWPO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YTOU2JV3CLZWVDMFL3B45IZWPO","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":"55359101d81d7da61f6c74b7f2ab88c8c8f878a6808a370d35ca2c8dfff2f3de","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-02T18:10:40Z","title_canon_sha256":"c632cf92ee78950a4cbe5b263174fc9b8b7bf60171f854cef66bb0a6091df4d1"},"schema_version":"1.0","source":{"id":"1404.0644","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0644","created_at":"2026-05-18T02:43:26Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0644v3","created_at":"2026-05-18T02:43:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0644","created_at":"2026-05-18T02:43:26Z"},{"alias_kind":"pith_short_12","alias_value":"YTOU2JV3CLZW","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YTOU2JV3CLZWVDMF","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YTOU2JV3","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:44eb0c79216a2c4b9c12d240709c3db78ad4e610c65b7a21836689697411b3a1","target":"graph","created_at":"2026-05-18T02:43:26Z","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":"We study the decidability of three well-known problems related to integer matrix multiplication: Mortality (M), Zero in the Left-Upper Corner (Z), and Zero in the Right-Upper Corner (R).\n  Let d and k be positive integers. Define M(k, d x d) as the following special case of the Mortality problem: given a set X of d -by-d integer matrices such that the cardinality of X is not greater than k, decide whether the d-by-d zero matrix belongs to X^+, where X^+ denotes the closure of X under the usual matrix multiplication. In the same way, define the Z(k, d x d) problem as: given an instance X of M(k","authors_text":"Francois Nicolas, Julien Cassaigne, Tero Harju, Vesa Halava","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-02T18:10:40Z","title":"Tighter Undecidability Bounds for Matrix Mortality, Zero-in-the-Corner Problems, and More"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0644","kind":"arxiv","version":3},"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:6c256f03602c4401fcffb5ba0927eadfe846a55f3f4898fe302382a6f9222f8d","target":"record","created_at":"2026-05-18T02:43:26Z","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":"55359101d81d7da61f6c74b7f2ab88c8c8f878a6808a370d35ca2c8dfff2f3de","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-02T18:10:40Z","title_canon_sha256":"c632cf92ee78950a4cbe5b263174fc9b8b7bf60171f854cef66bb0a6091df4d1"},"schema_version":"1.0","source":{"id":"1404.0644","kind":"arxiv","version":3}},"canonical_sha256":"c4dd4d26bb12f36a8d855ec3cea3367b830884bbe142abf2df5cd4249a8a7d3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4dd4d26bb12f36a8d855ec3cea3367b830884bbe142abf2df5cd4249a8a7d3a","first_computed_at":"2026-05-18T02:43:26.017245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:26.017245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F1rDdZxOSd2ZAVkeCHExRQ0NRY+v012y5kriITtFe/QlwMfIY2NRXxOvwsf81xK6Tnle+U0Luz1hknGcfLWtCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:26.017969Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0644","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c256f03602c4401fcffb5ba0927eadfe846a55f3f4898fe302382a6f9222f8d","sha256:44eb0c79216a2c4b9c12d240709c3db78ad4e610c65b7a21836689697411b3a1"],"state_sha256":"fb9b950921784bbe84a99ee7500e6b00c95a8b35ca5e0afae87fdd3f52531f4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/A497qH8ilS6voyxYijXx0UQ08gwytt7/oeAiNKtNHkm2e2ggd1sySACbzF2yTOl1Ma12XPZ/sTLysAU/+OBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:54:50.075105Z","bundle_sha256":"23dde69f983bcfe2f3a7088da8e1765256203467902440bbf0aea8a690d2e774"}}