{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:I6X74BFDWSIAHG5JSDEKOTSWKA","short_pith_number":"pith:I6X74BFD","canonical_record":{"source":{"id":"1304.6962","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-25T17:02:07Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"052b174ce6aab0bd95cd02ce2146742fbfb750ff605b5ec96518e6d7ecaa0934","abstract_canon_sha256":"b245c84f43f10e7d1c68e1c700870bcb1f52615d056a19c878c086b6e6d2c939"},"schema_version":"1.0"},"canonical_sha256":"47affe04a3b490039ba990c8a74e56503673a9a2451ce58efbcf1500fc5a95d4","source":{"kind":"arxiv","id":"1304.6962","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6962","created_at":"2026-05-18T01:27:55Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6962v2","created_at":"2026-05-18T01:27:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6962","created_at":"2026-05-18T01:27:55Z"},{"alias_kind":"pith_short_12","alias_value":"I6X74BFDWSIA","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I6X74BFDWSIAHG5J","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I6X74BFD","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:I6X74BFDWSIAHG5JSDEKOTSWKA","target":"record","payload":{"canonical_record":{"source":{"id":"1304.6962","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-25T17:02:07Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"052b174ce6aab0bd95cd02ce2146742fbfb750ff605b5ec96518e6d7ecaa0934","abstract_canon_sha256":"b245c84f43f10e7d1c68e1c700870bcb1f52615d056a19c878c086b6e6d2c939"},"schema_version":"1.0"},"canonical_sha256":"47affe04a3b490039ba990c8a74e56503673a9a2451ce58efbcf1500fc5a95d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:55.022419Z","signature_b64":"RJJlJr0zlLWKYH9CF/hZfe1slHuOf3GtVNWT3AP60oMQcWRbHevMWHnSuZ5+1lyEmzIx7u3Wwu+xpzaykubbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47affe04a3b490039ba990c8a74e56503673a9a2451ce58efbcf1500fc5a95d4","last_reissued_at":"2026-05-18T01:27:55.021635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:55.021635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.6962","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-18T01:27:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Ktuda5RNkGgIDMAO62lycxH/61N8eue+PM/m0ccef5o7YgPgbkEzlz+6Olo5DywjflY8pwRRE6MH56SDHPyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T23:08:32.115487Z"},"content_sha256":"dd0339a2c3c206983e50dccc583e226f659c2dbce87ddd597c9b029eb7cbe81a","schema_version":"1.0","event_id":"sha256:dd0339a2c3c206983e50dccc583e226f659c2dbce87ddd597c9b029eb7cbe81a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:I6X74BFDWSIAHG5JSDEKOTSWKA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variable projection methods for approximate (greatest) common divisor computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Ivan Markovsky, Konstantin Usevich","submitted_at":"2013-04-25T17:02:07Z","abstract_excerpt":"We consider the problem of finding for a given $N$-tuple of polynomials (real or complex) the closest $N$-tuple that has a common divisor of degree at least $d$. Extended weighted Euclidean seminorm of the coefficients is used as a measure of closeness. Two equivalent representations of the problem are considered: (i) direct parameterization over the common divisors and quotients (image representation), and (ii) Sylvester low-rank approximation (kernel representation). We use the duality between least-squares and least-norm problems to show that (i) and (ii) are closely related to mosaic Hanke"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6962","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-18T01:27:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FI9gw1sbSutj6g+J61bxBqgDGvc9TUJkZS0BfT4bciJBzYe1CxOb7Iu2XJIT0wknvSuK4p4VJQ4YD5pxkXONBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T23:08:32.115843Z"},"content_sha256":"538d6fd24697d55e4b509e0a4f8d189599c67e28b9362f8a8442a73cf339fc80","schema_version":"1.0","event_id":"sha256:538d6fd24697d55e4b509e0a4f8d189599c67e28b9362f8a8442a73cf339fc80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I6X74BFDWSIAHG5JSDEKOTSWKA/bundle.json","state_url":"https://pith.science/pith/I6X74BFDWSIAHG5JSDEKOTSWKA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I6X74BFDWSIAHG5JSDEKOTSWKA/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-23T23:08:32Z","links":{"resolver":"https://pith.science/pith/I6X74BFDWSIAHG5JSDEKOTSWKA","bundle":"https://pith.science/pith/I6X74BFDWSIAHG5JSDEKOTSWKA/bundle.json","state":"https://pith.science/pith/I6X74BFDWSIAHG5JSDEKOTSWKA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I6X74BFDWSIAHG5JSDEKOTSWKA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:I6X74BFDWSIAHG5JSDEKOTSWKA","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":"b245c84f43f10e7d1c68e1c700870bcb1f52615d056a19c878c086b6e6d2c939","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-25T17:02:07Z","title_canon_sha256":"052b174ce6aab0bd95cd02ce2146742fbfb750ff605b5ec96518e6d7ecaa0934"},"schema_version":"1.0","source":{"id":"1304.6962","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6962","created_at":"2026-05-18T01:27:55Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6962v2","created_at":"2026-05-18T01:27:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6962","created_at":"2026-05-18T01:27:55Z"},{"alias_kind":"pith_short_12","alias_value":"I6X74BFDWSIA","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I6X74BFDWSIAHG5J","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I6X74BFD","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:538d6fd24697d55e4b509e0a4f8d189599c67e28b9362f8a8442a73cf339fc80","target":"graph","created_at":"2026-05-18T01:27: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 consider the problem of finding for a given $N$-tuple of polynomials (real or complex) the closest $N$-tuple that has a common divisor of degree at least $d$. Extended weighted Euclidean seminorm of the coefficients is used as a measure of closeness. Two equivalent representations of the problem are considered: (i) direct parameterization over the common divisors and quotients (image representation), and (ii) Sylvester low-rank approximation (kernel representation). We use the duality between least-squares and least-norm problems to show that (i) and (ii) are closely related to mosaic Hanke","authors_text":"Ivan Markovsky, Konstantin Usevich","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-25T17:02:07Z","title":"Variable projection methods for approximate (greatest) common divisor computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6962","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:dd0339a2c3c206983e50dccc583e226f659c2dbce87ddd597c9b029eb7cbe81a","target":"record","created_at":"2026-05-18T01:27: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":"b245c84f43f10e7d1c68e1c700870bcb1f52615d056a19c878c086b6e6d2c939","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-25T17:02:07Z","title_canon_sha256":"052b174ce6aab0bd95cd02ce2146742fbfb750ff605b5ec96518e6d7ecaa0934"},"schema_version":"1.0","source":{"id":"1304.6962","kind":"arxiv","version":2}},"canonical_sha256":"47affe04a3b490039ba990c8a74e56503673a9a2451ce58efbcf1500fc5a95d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47affe04a3b490039ba990c8a74e56503673a9a2451ce58efbcf1500fc5a95d4","first_computed_at":"2026-05-18T01:27:55.021635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:55.021635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RJJlJr0zlLWKYH9CF/hZfe1slHuOf3GtVNWT3AP60oMQcWRbHevMWHnSuZ5+1lyEmzIx7u3Wwu+xpzaykubbCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:55.022419Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6962","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd0339a2c3c206983e50dccc583e226f659c2dbce87ddd597c9b029eb7cbe81a","sha256:538d6fd24697d55e4b509e0a4f8d189599c67e28b9362f8a8442a73cf339fc80"],"state_sha256":"e6ba9a596d5546294a54003fa07c70168deba224b485a96bbd7d4e4f35b5cd2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O9oG5ikFHj4ahVuGrU/uuuv+cEpTm16+loUqAd1aMlHJGi9/irlUjWyvVRRszAtgpT07J5NDmwc0hLSGXlFWBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T23:08:32.117847Z","bundle_sha256":"ac06a09b72775ac345bf91acf9057f97fee67f68625ac90c5c51abfbc666837b"}}