{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:REFFY27SAWXQ2EK74BTC4JLRHI","short_pith_number":"pith:REFFY27S","canonical_record":{"source":{"id":"1007.1836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2010-07-12T07:35:54Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"f8044400e9d9322926f5e6223e38bda7af023df04312a989192ec8a9374a306b","abstract_canon_sha256":"0b410d1166395b2673b73db09dce67f364206bf55032acc349aef363396d2e68"},"schema_version":"1.0"},"canonical_sha256":"890a5c6bf205af0d115fe0662e25713a21262eb6d2a3071c445e2b6f97dd163f","source":{"kind":"arxiv","id":"1007.1836","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.1836","created_at":"2026-05-18T02:06:23Z"},{"alias_kind":"arxiv_version","alias_value":"1007.1836v1","created_at":"2026-05-18T02:06:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1836","created_at":"2026-05-18T02:06:23Z"},{"alias_kind":"pith_short_12","alias_value":"REFFY27SAWXQ","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"REFFY27SAWXQ2EK7","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"REFFY27S","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:REFFY27SAWXQ2EK74BTC4JLRHI","target":"record","payload":{"canonical_record":{"source":{"id":"1007.1836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2010-07-12T07:35:54Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"f8044400e9d9322926f5e6223e38bda7af023df04312a989192ec8a9374a306b","abstract_canon_sha256":"0b410d1166395b2673b73db09dce67f364206bf55032acc349aef363396d2e68"},"schema_version":"1.0"},"canonical_sha256":"890a5c6bf205af0d115fe0662e25713a21262eb6d2a3071c445e2b6f97dd163f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:06:23.043173Z","signature_b64":"cJD4n6JFOumXDFLAb6vouqQRwPnxnYtici1aiJ1+QTB8Co5GJdAMi0AWbZGzCBHljk7fAtgj7A07fDFNR303Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"890a5c6bf205af0d115fe0662e25713a21262eb6d2a3071c445e2b6f97dd163f","last_reissued_at":"2026-05-18T02:06:23.042543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:06:23.042543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.1836","source_version":1,"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:06:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fc+4b4K+qBIFmzM+3BAKalbcZaGWbRtIBV1LxgA2xR2AhaIw9HCo22/x8Mx2h5Du+WFhwF2fhM2OuApHU2sfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T03:31:23.440524Z"},"content_sha256":"705af45029f2e93d539f445ad12d63e5866323a4ce3734b2f53d0c3a0bcd37f2","schema_version":"1.0","event_id":"sha256:705af45029f2e93d539f445ad12d63e5866323a4ce3734b2f53d0c3a0bcd37f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:REFFY27SAWXQ2EK74BTC4JLRHI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"math.AC","authors_text":"Akira Terui","submitted_at":"2010-07-12T07:35:54Z","abstract_excerpt":"We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to multiple polynomial inputs. For a given pair of polynomials and a degree, our algorithm finds a pair of polynomials which has a GCD of the given degree and whose coefficients are perturbed from those in the original inputs, making the perturbations as small as possible, along with the GCD. In our GPGCD method, the problem of approximate GCD is transferred to a constrained minimization problem, then solved with the so-called modified Newton met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1836","kind":"arxiv","version":1},"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:06:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ffXhJgKAlHondxfQ1TsfIp6lYVitYbK+5aAs9RLCNQcC+vEtT80ZTOU7fpE9sD5/kPxi/C5HvjKH5XhEPn6/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T03:31:23.440871Z"},"content_sha256":"2307d096b10821115c2e0c39e0ae51c74e78fbca07288b657881bfb38e153c6f","schema_version":"1.0","event_id":"sha256:2307d096b10821115c2e0c39e0ae51c74e78fbca07288b657881bfb38e153c6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/REFFY27SAWXQ2EK74BTC4JLRHI/bundle.json","state_url":"https://pith.science/pith/REFFY27SAWXQ2EK74BTC4JLRHI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/REFFY27SAWXQ2EK74BTC4JLRHI/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-21T03:31:23Z","links":{"resolver":"https://pith.science/pith/REFFY27SAWXQ2EK74BTC4JLRHI","bundle":"https://pith.science/pith/REFFY27SAWXQ2EK74BTC4JLRHI/bundle.json","state":"https://pith.science/pith/REFFY27SAWXQ2EK74BTC4JLRHI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/REFFY27SAWXQ2EK74BTC4JLRHI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:REFFY27SAWXQ2EK74BTC4JLRHI","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":"0b410d1166395b2673b73db09dce67f364206bf55032acc349aef363396d2e68","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2010-07-12T07:35:54Z","title_canon_sha256":"f8044400e9d9322926f5e6223e38bda7af023df04312a989192ec8a9374a306b"},"schema_version":"1.0","source":{"id":"1007.1836","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.1836","created_at":"2026-05-18T02:06:23Z"},{"alias_kind":"arxiv_version","alias_value":"1007.1836v1","created_at":"2026-05-18T02:06:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1836","created_at":"2026-05-18T02:06:23Z"},{"alias_kind":"pith_short_12","alias_value":"REFFY27SAWXQ","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"REFFY27SAWXQ2EK7","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"REFFY27S","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:2307d096b10821115c2e0c39e0ae51c74e78fbca07288b657881bfb38e153c6f","target":"graph","created_at":"2026-05-18T02:06:23Z","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 present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to multiple polynomial inputs. For a given pair of polynomials and a degree, our algorithm finds a pair of polynomials which has a GCD of the given degree and whose coefficients are perturbed from those in the original inputs, making the perturbations as small as possible, along with the GCD. In our GPGCD method, the problem of approximate GCD is transferred to a constrained minimization problem, then solved with the so-called modified Newton met","authors_text":"Akira Terui","cross_cats":["cs.SC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2010-07-12T07:35:54Z","title":"GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1836","kind":"arxiv","version":1},"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:705af45029f2e93d539f445ad12d63e5866323a4ce3734b2f53d0c3a0bcd37f2","target":"record","created_at":"2026-05-18T02:06:23Z","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":"0b410d1166395b2673b73db09dce67f364206bf55032acc349aef363396d2e68","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2010-07-12T07:35:54Z","title_canon_sha256":"f8044400e9d9322926f5e6223e38bda7af023df04312a989192ec8a9374a306b"},"schema_version":"1.0","source":{"id":"1007.1836","kind":"arxiv","version":1}},"canonical_sha256":"890a5c6bf205af0d115fe0662e25713a21262eb6d2a3071c445e2b6f97dd163f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"890a5c6bf205af0d115fe0662e25713a21262eb6d2a3071c445e2b6f97dd163f","first_computed_at":"2026-05-18T02:06:23.042543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:06:23.042543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cJD4n6JFOumXDFLAb6vouqQRwPnxnYtici1aiJ1+QTB8Co5GJdAMi0AWbZGzCBHljk7fAtgj7A07fDFNR303Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:06:23.043173Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.1836","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:705af45029f2e93d539f445ad12d63e5866323a4ce3734b2f53d0c3a0bcd37f2","sha256:2307d096b10821115c2e0c39e0ae51c74e78fbca07288b657881bfb38e153c6f"],"state_sha256":"8e5cd2446d4cdcf626f67c062dd30c3773ec2b5276c9f03ba84eb5a4f8dd64a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Fzzjds5xbrxxvM6yhSxwPeaQcjP1GVU/9UvKbm+9vC/mpZZiR3eKgpekKPHs/v5uJ/JWLIEoH5uMxxzLozqBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T03:31:23.442839Z","bundle_sha256":"27d761386f3c65cf1940dfe4f331279be9d9a79cd26d423013a55b8107454ee3"}}