{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QHZGCRME5QO66IHTTG3WR3AN2G","short_pith_number":"pith:QHZGCRME","canonical_record":{"source":{"id":"1609.02310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-09-08T07:39:37Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"b4a25ed8c4e08bda05e577b854c792de051295fbb004d761b0e4c835ec8fab90","abstract_canon_sha256":"14bee18c1ecfd4cc81449c3a81feacad06acb7ccd379565519b6e4bc8562f32c"},"schema_version":"1.0"},"canonical_sha256":"81f2614584ec1def20f399b768ec0dd180d04b5cf3644fb43f46040847cf5675","source":{"kind":"arxiv","id":"1609.02310","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.02310","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"arxiv_version","alias_value":"1609.02310v2","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02310","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"pith_short_12","alias_value":"QHZGCRME5QO6","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QHZGCRME5QO66IHT","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QHZGCRME","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QHZGCRME5QO66IHTTG3WR3AN2G","target":"record","payload":{"canonical_record":{"source":{"id":"1609.02310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-09-08T07:39:37Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"b4a25ed8c4e08bda05e577b854c792de051295fbb004d761b0e4c835ec8fab90","abstract_canon_sha256":"14bee18c1ecfd4cc81449c3a81feacad06acb7ccd379565519b6e4bc8562f32c"},"schema_version":"1.0"},"canonical_sha256":"81f2614584ec1def20f399b768ec0dd180d04b5cf3644fb43f46040847cf5675","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:55.574415Z","signature_b64":"FGx41i7saUjz1Q5FrvcoykOw43G53+wSefX5g4NhFx3nivn7Ihkr0tnbCG9IVIhpRPcEz7PYcwpjU5s8qUEeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81f2614584ec1def20f399b768ec0dd180d04b5cf3644fb43f46040847cf5675","last_reissued_at":"2026-05-18T00:46:55.573956Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:55.573956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.02310","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:46:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OcK0Oc0UpcUcpr9brdjMtcoc/qtRmdr7cZVdYfDwYja2PUMr/WQy2G1IEd+azZ6D8MVTI+qYvUt12IoFvleoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:34:55.818949Z"},"content_sha256":"af882e8944ba5373bd116fc61b8c767a77e8306c0be2d74baddcc78a277f3310","schema_version":"1.0","event_id":"sha256:af882e8944ba5373bd116fc61b8c767a77e8306c0be2d74baddcc78a277f3310"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QHZGCRME5QO66IHTTG3WR3AN2G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Probability of Primeness for Specially Structured Polynomial Matrices over Finite Fields with Applications to Linear Systems and Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"math.DS","authors_text":"Julia Lieb","submitted_at":"2016-09-08T07:39:37Z","abstract_excerpt":"We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many nonsingular polynomial matrices are mutually left coprime. These results are used to estimate the number of reachable and observable linear systems as well as the number of non-catastrophic convolutional codes. Moreover, we are able to achieve an asymptotic formula for the probability that a parallel connected linear system is reachable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02310","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:46:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"We/Hap5vIMrrIBRKhaNL1EWVAGdJnKb49aCznCshEZVzM6ZGLjCbmm/gTCCpGOkw4aKmBJGR5KJvBOBYpJL2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:34:55.819304Z"},"content_sha256":"e93558fd9d97b3df18d17820673265364e9d13853a2621292f6a0a13dc767988","schema_version":"1.0","event_id":"sha256:e93558fd9d97b3df18d17820673265364e9d13853a2621292f6a0a13dc767988"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHZGCRME5QO66IHTTG3WR3AN2G/bundle.json","state_url":"https://pith.science/pith/QHZGCRME5QO66IHTTG3WR3AN2G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHZGCRME5QO66IHTTG3WR3AN2G/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-08T22:34:55Z","links":{"resolver":"https://pith.science/pith/QHZGCRME5QO66IHTTG3WR3AN2G","bundle":"https://pith.science/pith/QHZGCRME5QO66IHTTG3WR3AN2G/bundle.json","state":"https://pith.science/pith/QHZGCRME5QO66IHTTG3WR3AN2G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHZGCRME5QO66IHTTG3WR3AN2G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QHZGCRME5QO66IHTTG3WR3AN2G","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":"14bee18c1ecfd4cc81449c3a81feacad06acb7ccd379565519b6e4bc8562f32c","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-09-08T07:39:37Z","title_canon_sha256":"b4a25ed8c4e08bda05e577b854c792de051295fbb004d761b0e4c835ec8fab90"},"schema_version":"1.0","source":{"id":"1609.02310","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.02310","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"arxiv_version","alias_value":"1609.02310v2","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02310","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"pith_short_12","alias_value":"QHZGCRME5QO6","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QHZGCRME5QO66IHT","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QHZGCRME","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:e93558fd9d97b3df18d17820673265364e9d13853a2621292f6a0a13dc767988","target":"graph","created_at":"2026-05-18T00:46:55Z","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 calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many nonsingular polynomial matrices are mutually left coprime. These results are used to estimate the number of reachable and observable linear systems as well as the number of non-catastrophic convolutional codes. Moreover, we are able to achieve an asymptotic formula for the probability that a parallel connected linear system is reachable.","authors_text":"Julia Lieb","cross_cats":["cs.IT","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-09-08T07:39:37Z","title":"The Probability of Primeness for Specially Structured Polynomial Matrices over Finite Fields with Applications to Linear Systems and Convolutional Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02310","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:af882e8944ba5373bd116fc61b8c767a77e8306c0be2d74baddcc78a277f3310","target":"record","created_at":"2026-05-18T00:46:55Z","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":"14bee18c1ecfd4cc81449c3a81feacad06acb7ccd379565519b6e4bc8562f32c","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-09-08T07:39:37Z","title_canon_sha256":"b4a25ed8c4e08bda05e577b854c792de051295fbb004d761b0e4c835ec8fab90"},"schema_version":"1.0","source":{"id":"1609.02310","kind":"arxiv","version":2}},"canonical_sha256":"81f2614584ec1def20f399b768ec0dd180d04b5cf3644fb43f46040847cf5675","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81f2614584ec1def20f399b768ec0dd180d04b5cf3644fb43f46040847cf5675","first_computed_at":"2026-05-18T00:46:55.573956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:55.573956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FGx41i7saUjz1Q5FrvcoykOw43G53+wSefX5g4NhFx3nivn7Ihkr0tnbCG9IVIhpRPcEz7PYcwpjU5s8qUEeBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:55.574415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.02310","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af882e8944ba5373bd116fc61b8c767a77e8306c0be2d74baddcc78a277f3310","sha256:e93558fd9d97b3df18d17820673265364e9d13853a2621292f6a0a13dc767988"],"state_sha256":"4846d91386d3444a529f3f85b2e6671fa86c4ba4cf527ab5967f7e040b563262"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4VieccFVFvM/bcc72Lh2fFq/Ly/YencRVsBlJ+HD166Vn7REt6nTAESUjABcQgJsPDGh4mEcWJHOnBSa+tlrAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:34:55.821181Z","bundle_sha256":"ff47d961c22e8b41f939a5cddc2874c619c6e2295cf3b5251ecfe243db15ae8b"}}