{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OTTHJUGCORHKN3ISEF4H4WYGZJ","short_pith_number":"pith:OTTHJUGC","canonical_record":{"source":{"id":"1307.5529","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2013-07-21T15:03:52Z","cross_cats_sorted":[],"title_canon_sha256":"ce8590399613ec41ba9a0247956e86199d3a44451ec836d776b02dde15a604a8","abstract_canon_sha256":"b6746e8330fe1275bb222dff476db99008c2dceb0d6b2b4fd6a760905b2c3565"},"schema_version":"1.0"},"canonical_sha256":"74e674d0c2744ea6ed1221787e5b06ca7b9e21eaf33afe288e75040b7634cc4d","source":{"kind":"arxiv","id":"1307.5529","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5529","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5529v2","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5529","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"pith_short_12","alias_value":"OTTHJUGCORHK","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OTTHJUGCORHKN3IS","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OTTHJUGC","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OTTHJUGCORHKN3ISEF4H4WYGZJ","target":"record","payload":{"canonical_record":{"source":{"id":"1307.5529","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2013-07-21T15:03:52Z","cross_cats_sorted":[],"title_canon_sha256":"ce8590399613ec41ba9a0247956e86199d3a44451ec836d776b02dde15a604a8","abstract_canon_sha256":"b6746e8330fe1275bb222dff476db99008c2dceb0d6b2b4fd6a760905b2c3565"},"schema_version":"1.0"},"canonical_sha256":"74e674d0c2744ea6ed1221787e5b06ca7b9e21eaf33afe288e75040b7634cc4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:47.263504Z","signature_b64":"oswsROlMFKhBDzOVAY7JT30ccJDanUCgLQ9eASbPgQitseNZFeqe/M9my+6osRNzDFZQwvz2fxtBJc8O98huCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74e674d0c2744ea6ed1221787e5b06ca7b9e21eaf33afe288e75040b7634cc4d","last_reissued_at":"2026-05-18T00:18:47.262939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:47.262939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.5529","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:18:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6vRuLuCrCF7EhosVqD2oTRz4mGRvHdCl2STkAofu4Gd8aJ//nufLLpAG/1tP7UBTh1PaxhPQp4UGrmVCHGQrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:17:07.405940Z"},"content_sha256":"c46d477a56a8eea7d77393641f0d0dd291da52d41ec8611a58e0b644d9fdd51e","schema_version":"1.0","event_id":"sha256:c46d477a56a8eea7d77393641f0d0dd291da52d41ec8611a58e0b644d9fdd51e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OTTHJUGCORHKN3ISEF4H4WYGZJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing the bound of an Ore polynomial. Applications to factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"F. J. Lobillo, Gabriel Navarro, Jose Gomez-Torrecillas","submitted_at":"2013-07-21T15:03:52Z","abstract_excerpt":"We develop a fast algorithm for computing the bound of an Ore polynomial over a skew field, under mild conditions. As an application, we state a criterion for deciding whether a bounded Ore polynomial is irreducible, and we discuss a factorization algorithm. The asymptotic time complexity in the degree of the given Ore polynomial is studied. In the class of Ore polynomials over a finite field, our algorithm is an alternative to Giesbretch's one that reduces the complexity in the degree of the polynomial."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5529","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:18:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7fdVzbjg9WaVsjTu4OaEr1KW+ZNlAlFmQzSeyxArhX+iHVjFrcmZlJb/kb6ZxCk8RnYE6rEI2auFQZv/SRPWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:17:07.406280Z"},"content_sha256":"bfc8c574112452123091c9e1d519141a34332c2e5620da20f1ef305b78c1ef89","schema_version":"1.0","event_id":"sha256:bfc8c574112452123091c9e1d519141a34332c2e5620da20f1ef305b78c1ef89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTTHJUGCORHKN3ISEF4H4WYGZJ/bundle.json","state_url":"https://pith.science/pith/OTTHJUGCORHKN3ISEF4H4WYGZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTTHJUGCORHKN3ISEF4H4WYGZJ/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-30T06:17:07Z","links":{"resolver":"https://pith.science/pith/OTTHJUGCORHKN3ISEF4H4WYGZJ","bundle":"https://pith.science/pith/OTTHJUGCORHKN3ISEF4H4WYGZJ/bundle.json","state":"https://pith.science/pith/OTTHJUGCORHKN3ISEF4H4WYGZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTTHJUGCORHKN3ISEF4H4WYGZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OTTHJUGCORHKN3ISEF4H4WYGZJ","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":"b6746e8330fe1275bb222dff476db99008c2dceb0d6b2b4fd6a760905b2c3565","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2013-07-21T15:03:52Z","title_canon_sha256":"ce8590399613ec41ba9a0247956e86199d3a44451ec836d776b02dde15a604a8"},"schema_version":"1.0","source":{"id":"1307.5529","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5529","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5529v2","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5529","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"pith_short_12","alias_value":"OTTHJUGCORHK","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OTTHJUGCORHKN3IS","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OTTHJUGC","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:bfc8c574112452123091c9e1d519141a34332c2e5620da20f1ef305b78c1ef89","target":"graph","created_at":"2026-05-18T00:18:47Z","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 develop a fast algorithm for computing the bound of an Ore polynomial over a skew field, under mild conditions. As an application, we state a criterion for deciding whether a bounded Ore polynomial is irreducible, and we discuss a factorization algorithm. The asymptotic time complexity in the degree of the given Ore polynomial is studied. In the class of Ore polynomials over a finite field, our algorithm is an alternative to Giesbretch's one that reduces the complexity in the degree of the polynomial.","authors_text":"F. J. Lobillo, Gabriel Navarro, Jose Gomez-Torrecillas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2013-07-21T15:03:52Z","title":"Computing the bound of an Ore polynomial. Applications to factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5529","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:c46d477a56a8eea7d77393641f0d0dd291da52d41ec8611a58e0b644d9fdd51e","target":"record","created_at":"2026-05-18T00:18:47Z","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":"b6746e8330fe1275bb222dff476db99008c2dceb0d6b2b4fd6a760905b2c3565","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2013-07-21T15:03:52Z","title_canon_sha256":"ce8590399613ec41ba9a0247956e86199d3a44451ec836d776b02dde15a604a8"},"schema_version":"1.0","source":{"id":"1307.5529","kind":"arxiv","version":2}},"canonical_sha256":"74e674d0c2744ea6ed1221787e5b06ca7b9e21eaf33afe288e75040b7634cc4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74e674d0c2744ea6ed1221787e5b06ca7b9e21eaf33afe288e75040b7634cc4d","first_computed_at":"2026-05-18T00:18:47.262939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:47.262939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oswsROlMFKhBDzOVAY7JT30ccJDanUCgLQ9eASbPgQitseNZFeqe/M9my+6osRNzDFZQwvz2fxtBJc8O98huCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:47.263504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5529","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c46d477a56a8eea7d77393641f0d0dd291da52d41ec8611a58e0b644d9fdd51e","sha256:bfc8c574112452123091c9e1d519141a34332c2e5620da20f1ef305b78c1ef89"],"state_sha256":"9b5c1d3e035e107dd74fd663280ceaf2268fc9e3f37250e5c8bce3d2dd40c2bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nk1Z42hslR9EYthffBpG2+E16Nn6lmgw7XG8hlDt0wSzKy11Cq4T2XirLfvf0BNsGAwWynjnwUL6y/PAsAbICA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:17:07.408264Z","bundle_sha256":"e5f03eb56247e66d0653be735cc7bfb9c430b186a8d67d9750f821937049d710"}}