{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CF3A4EOSLIVJYYTJ4NAEE4QPFA","short_pith_number":"pith:CF3A4EOS","canonical_record":{"source":{"id":"1606.04909","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-06-15T19:05:55Z","cross_cats_sorted":[],"title_canon_sha256":"7f3b3eed69357c904ad83a56fd4939bb39fd26f012433a36d62e81eff14ddd9a","abstract_canon_sha256":"af765ea7047f0a099b120d713b146fda7e05a0418fee52ed9664a48e6ec83dec"},"schema_version":"1.0"},"canonical_sha256":"11760e11d25a2a9c6269e34042720f2833addcfc3654c38cfcdc3b13f23e1b18","source":{"kind":"arxiv","id":"1606.04909","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04909","created_at":"2026-05-18T00:48:32Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04909v2","created_at":"2026-05-18T00:48:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04909","created_at":"2026-05-18T00:48:32Z"},{"alias_kind":"pith_short_12","alias_value":"CF3A4EOSLIVJ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CF3A4EOSLIVJYYTJ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CF3A4EOS","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CF3A4EOSLIVJYYTJ4NAEE4QPFA","target":"record","payload":{"canonical_record":{"source":{"id":"1606.04909","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-06-15T19:05:55Z","cross_cats_sorted":[],"title_canon_sha256":"7f3b3eed69357c904ad83a56fd4939bb39fd26f012433a36d62e81eff14ddd9a","abstract_canon_sha256":"af765ea7047f0a099b120d713b146fda7e05a0418fee52ed9664a48e6ec83dec"},"schema_version":"1.0"},"canonical_sha256":"11760e11d25a2a9c6269e34042720f2833addcfc3654c38cfcdc3b13f23e1b18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:32.849913Z","signature_b64":"m4KG2sr8Jpzih60st5x0wPCTJDXxpIz5iynwml0fMQGypIrzEpJMbrDHM15zA2VDeoHtmrW4HxTtFaPQCoXkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11760e11d25a2a9c6269e34042720f2833addcfc3654c38cfcdc3b13f23e1b18","last_reissued_at":"2026-05-18T00:48:32.849328Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:32.849328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.04909","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:48:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rx28EVrCBMhNihcFuWNt2VC9wGdxfCiCw7DXyybx04UrFv9k1cn8TfNbb27ia++k2++fHCXquggscOvhXQ0nCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:52:21.032109Z"},"content_sha256":"ebfa58838ee6258148959230e41a0bce9d4fe053d57038faad29651059058fd9","schema_version":"1.0","event_id":"sha256:ebfa58838ee6258148959230e41a0bce9d4fe053d57038faad29651059058fd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CF3A4EOSLIVJYYTJ4NAEE4QPFA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On algorithmization of Janashia-Lagvilava matrix spectral factorization method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"F. Saied, I. Spitkovsky, L. Ephremidze","submitted_at":"2016-06-15T19:05:55Z","abstract_excerpt":"We consider three different ways of algorithmization of the Janashia-Lagvilava spectral factorization method. The first algorithm is faster than the second one, however, it is only suitable for matrices of low dimension. The second algorithm, on the other hand, can be applied to matrices of substantially larger dimension. The third algorithm is a superfast implementation of the method, but only works in the polynomial case under the additional restriction that the zeros of the determinant are not too close to the boundary. All three algorithms fully utilize the advantage of the method which ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04909","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:48:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFVS8XdwBwhtPeCIhrELjwRYnHZwOsXJkZhcmXbRb8M7wG/YF5Jy82Q41dz2DvZ/Z+R7bC1Uzzo+8N0Kds+SDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:52:21.032477Z"},"content_sha256":"4473b2fc4cf3119420e95b8816250cb8f717fad34ef122a8882a0ca01a823705","schema_version":"1.0","event_id":"sha256:4473b2fc4cf3119420e95b8816250cb8f717fad34ef122a8882a0ca01a823705"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CF3A4EOSLIVJYYTJ4NAEE4QPFA/bundle.json","state_url":"https://pith.science/pith/CF3A4EOSLIVJYYTJ4NAEE4QPFA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CF3A4EOSLIVJYYTJ4NAEE4QPFA/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-09T14:52:21Z","links":{"resolver":"https://pith.science/pith/CF3A4EOSLIVJYYTJ4NAEE4QPFA","bundle":"https://pith.science/pith/CF3A4EOSLIVJYYTJ4NAEE4QPFA/bundle.json","state":"https://pith.science/pith/CF3A4EOSLIVJYYTJ4NAEE4QPFA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CF3A4EOSLIVJYYTJ4NAEE4QPFA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CF3A4EOSLIVJYYTJ4NAEE4QPFA","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":"af765ea7047f0a099b120d713b146fda7e05a0418fee52ed9664a48e6ec83dec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-06-15T19:05:55Z","title_canon_sha256":"7f3b3eed69357c904ad83a56fd4939bb39fd26f012433a36d62e81eff14ddd9a"},"schema_version":"1.0","source":{"id":"1606.04909","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04909","created_at":"2026-05-18T00:48:32Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04909v2","created_at":"2026-05-18T00:48:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04909","created_at":"2026-05-18T00:48:32Z"},{"alias_kind":"pith_short_12","alias_value":"CF3A4EOSLIVJ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CF3A4EOSLIVJYYTJ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CF3A4EOS","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:4473b2fc4cf3119420e95b8816250cb8f717fad34ef122a8882a0ca01a823705","target":"graph","created_at":"2026-05-18T00:48:32Z","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 consider three different ways of algorithmization of the Janashia-Lagvilava spectral factorization method. The first algorithm is faster than the second one, however, it is only suitable for matrices of low dimension. The second algorithm, on the other hand, can be applied to matrices of substantially larger dimension. The third algorithm is a superfast implementation of the method, but only works in the polynomial case under the additional restriction that the zeros of the determinant are not too close to the boundary. All three algorithms fully utilize the advantage of the method which ca","authors_text":"F. Saied, I. Spitkovsky, L. Ephremidze","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-06-15T19:05:55Z","title":"On algorithmization of Janashia-Lagvilava matrix spectral factorization method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04909","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:ebfa58838ee6258148959230e41a0bce9d4fe053d57038faad29651059058fd9","target":"record","created_at":"2026-05-18T00:48:32Z","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":"af765ea7047f0a099b120d713b146fda7e05a0418fee52ed9664a48e6ec83dec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-06-15T19:05:55Z","title_canon_sha256":"7f3b3eed69357c904ad83a56fd4939bb39fd26f012433a36d62e81eff14ddd9a"},"schema_version":"1.0","source":{"id":"1606.04909","kind":"arxiv","version":2}},"canonical_sha256":"11760e11d25a2a9c6269e34042720f2833addcfc3654c38cfcdc3b13f23e1b18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11760e11d25a2a9c6269e34042720f2833addcfc3654c38cfcdc3b13f23e1b18","first_computed_at":"2026-05-18T00:48:32.849328Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:32.849328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m4KG2sr8Jpzih60st5x0wPCTJDXxpIz5iynwml0fMQGypIrzEpJMbrDHM15zA2VDeoHtmrW4HxTtFaPQCoXkCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:32.849913Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.04909","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebfa58838ee6258148959230e41a0bce9d4fe053d57038faad29651059058fd9","sha256:4473b2fc4cf3119420e95b8816250cb8f717fad34ef122a8882a0ca01a823705"],"state_sha256":"24d13ebbdc8bff377819e3e8b2f20c03bcbb73c732d7f0af43680860c101174e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xVAxuqxKQsUmn7LF3YXWOWfYhComdFq8AcPKJN3KsMCV8N7GHBSEJSYOKZdu4SSwzZ23TvaYMla7pmh0w9LWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:52:21.034565Z","bundle_sha256":"d9730ce8488106095dc98255bb7584a0fa0d86cf89797e6f7b823b487ceaaa75"}}