{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:G2QIEA7ARWDAWVDRSUCC37XPLG","short_pith_number":"pith:G2QIEA7A","canonical_record":{"source":{"id":"1603.04813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2016-03-15T18:46:15Z","cross_cats_sorted":["cs.SC","math.AC"],"title_canon_sha256":"2c9d5aa2b650e3a0993e5c65f0d440441426f548d914bbdeab9f66c9e78ddc13","abstract_canon_sha256":"3219ade6211cf01c950b50c1a112dcd6864f6dca73df065721fa9d81a6ee77cf"},"schema_version":"1.0"},"canonical_sha256":"36a08203e08d860b547195042dfeef5983db57c3bb67b0299cd537e0a9e9e0ae","source":{"kind":"arxiv","id":"1603.04813","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04813","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04813v2","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04813","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"pith_short_12","alias_value":"G2QIEA7ARWDA","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G2QIEA7ARWDAWVDR","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G2QIEA7A","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:G2QIEA7ARWDAWVDRSUCC37XPLG","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2016-03-15T18:46:15Z","cross_cats_sorted":["cs.SC","math.AC"],"title_canon_sha256":"2c9d5aa2b650e3a0993e5c65f0d440441426f548d914bbdeab9f66c9e78ddc13","abstract_canon_sha256":"3219ade6211cf01c950b50c1a112dcd6864f6dca73df065721fa9d81a6ee77cf"},"schema_version":"1.0"},"canonical_sha256":"36a08203e08d860b547195042dfeef5983db57c3bb67b0299cd537e0a9e9e0ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:06.847804Z","signature_b64":"zriQn2MKkNvR76E849UY198k5vYnqPb4v7Xkr/fdQ2LnkwfsaZ1jT+nQAxgnXBHbASwJ+Wn+HPJMPDm7IAsXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36a08203e08d860b547195042dfeef5983db57c3bb67b0299cd537e0a9e9e0ae","last_reissued_at":"2026-05-18T00:49:06.847371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:06.847371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04813","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:49:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yTxWh19muEPysO3i3+L4TgBBzrUhdyDw3dToP6bw3Yed96jmCq/K/1zVn4jBszOOFboLUSKTflcaAdRkxMxZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:28:08.786839Z"},"content_sha256":"75b9def4276e59d9c0036f64656ecaef5edd1b8aca34f5eabd89454a290a504e","schema_version":"1.0","event_id":"sha256:75b9def4276e59d9c0036f64656ecaef5edd1b8aca34f5eabd89454a290a504e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:G2QIEA7ARWDAWVDRSUCC37XPLG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithm for computing $\\mu$-bases of univariate polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.AC"],"primary_cat":"math.AG","authors_text":"Hoon Hong, Irina A. Kogan, Zachary Hough","submitted_at":"2016-03-15T18:46:15Z","abstract_excerpt":"We present a new algorithm for computing a $\\mu$-basis of the syzygy module of $n$ polynomials in one variable over an arbitrary field $\\mathbb{K}$. The algorithm is conceptually different from the previously-developed algorithms by Cox, Sederberg, Chen, Zheng, and Wang for $n=3$, and by Song and Goldman for an arbitrary $n$. It involves computing a \"partial\" reduced row-echelon form of a $ (2d+1)\\times n(d+1)$ matrix over $\\mathbb{K}$, where $d$ is the maximum degree of the input polynomials. The proof of the algorithm is based on standard linear algebra and is completely self-contained. It i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04813","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:49:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ljpetivsQXUjMy9fxvr2joIOvPbH2WE1I3VmMWdFRsrffWQMcfm2aJakPfqsRVnbHEs+GmFr674ww28Ug81gDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:28:08.787518Z"},"content_sha256":"a1537982bd3957d0fa1b8ddd5fff7be23035075cec912328b52ceceda652a997","schema_version":"1.0","event_id":"sha256:a1537982bd3957d0fa1b8ddd5fff7be23035075cec912328b52ceceda652a997"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G2QIEA7ARWDAWVDRSUCC37XPLG/bundle.json","state_url":"https://pith.science/pith/G2QIEA7ARWDAWVDRSUCC37XPLG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G2QIEA7ARWDAWVDRSUCC37XPLG/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-19T08:28:08Z","links":{"resolver":"https://pith.science/pith/G2QIEA7ARWDAWVDRSUCC37XPLG","bundle":"https://pith.science/pith/G2QIEA7ARWDAWVDRSUCC37XPLG/bundle.json","state":"https://pith.science/pith/G2QIEA7ARWDAWVDRSUCC37XPLG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G2QIEA7ARWDAWVDRSUCC37XPLG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:G2QIEA7ARWDAWVDRSUCC37XPLG","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":"3219ade6211cf01c950b50c1a112dcd6864f6dca73df065721fa9d81a6ee77cf","cross_cats_sorted":["cs.SC","math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2016-03-15T18:46:15Z","title_canon_sha256":"2c9d5aa2b650e3a0993e5c65f0d440441426f548d914bbdeab9f66c9e78ddc13"},"schema_version":"1.0","source":{"id":"1603.04813","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04813","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04813v2","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04813","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"pith_short_12","alias_value":"G2QIEA7ARWDA","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G2QIEA7ARWDAWVDR","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G2QIEA7A","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:a1537982bd3957d0fa1b8ddd5fff7be23035075cec912328b52ceceda652a997","target":"graph","created_at":"2026-05-18T00:49:06Z","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 a new algorithm for computing a $\\mu$-basis of the syzygy module of $n$ polynomials in one variable over an arbitrary field $\\mathbb{K}$. The algorithm is conceptually different from the previously-developed algorithms by Cox, Sederberg, Chen, Zheng, and Wang for $n=3$, and by Song and Goldman for an arbitrary $n$. It involves computing a \"partial\" reduced row-echelon form of a $ (2d+1)\\times n(d+1)$ matrix over $\\mathbb{K}$, where $d$ is the maximum degree of the input polynomials. The proof of the algorithm is based on standard linear algebra and is completely self-contained. It i","authors_text":"Hoon Hong, Irina A. Kogan, Zachary Hough","cross_cats":["cs.SC","math.AC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2016-03-15T18:46:15Z","title":"Algorithm for computing $\\mu$-bases of univariate polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04813","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:75b9def4276e59d9c0036f64656ecaef5edd1b8aca34f5eabd89454a290a504e","target":"record","created_at":"2026-05-18T00:49:06Z","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":"3219ade6211cf01c950b50c1a112dcd6864f6dca73df065721fa9d81a6ee77cf","cross_cats_sorted":["cs.SC","math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2016-03-15T18:46:15Z","title_canon_sha256":"2c9d5aa2b650e3a0993e5c65f0d440441426f548d914bbdeab9f66c9e78ddc13"},"schema_version":"1.0","source":{"id":"1603.04813","kind":"arxiv","version":2}},"canonical_sha256":"36a08203e08d860b547195042dfeef5983db57c3bb67b0299cd537e0a9e9e0ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36a08203e08d860b547195042dfeef5983db57c3bb67b0299cd537e0a9e9e0ae","first_computed_at":"2026-05-18T00:49:06.847371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:06.847371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zriQn2MKkNvR76E849UY198k5vYnqPb4v7Xkr/fdQ2LnkwfsaZ1jT+nQAxgnXBHbASwJ+Wn+HPJMPDm7IAsXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:06.847804Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04813","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75b9def4276e59d9c0036f64656ecaef5edd1b8aca34f5eabd89454a290a504e","sha256:a1537982bd3957d0fa1b8ddd5fff7be23035075cec912328b52ceceda652a997"],"state_sha256":"9e0d84bfacb00fed95cb15979cf839c861a7b5c114b4997b0b059046ca181c88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qWmIXe7nLwdDGPp8i9pmDidDY6y87P6XkKAnECWD9EFnU23PXWo83vefK0vDTKCJ+dcb8UvM65g10O8ftQtTBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T08:28:08.790698Z","bundle_sha256":"1923bbba4942ccc9e80f4f24cc118a8f3b1e70c7756e43a35a5a8f1500df3ade"}}