{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OQVEMAWP6Y7YRGNRQAJZOY3QGM","short_pith_number":"pith:OQVEMAWP","canonical_record":{"source":{"id":"1704.06979","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-04-23T20:48:43Z","cross_cats_sorted":[],"title_canon_sha256":"5d0f777fdac69a7c0aa0faa07c1e1b268b81548357acac807c4ecc14480357ac","abstract_canon_sha256":"acdb620bbf71a272742e21b8d4854bf8d6dc7a789accd82b761a358acb48b6d5"},"schema_version":"1.0"},"canonical_sha256":"742a4602cff63f8899b180139763703307d37cbfcbc8eab372d15bbb142992f6","source":{"kind":"arxiv","id":"1704.06979","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06979","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06979v1","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06979","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"OQVEMAWP6Y7Y","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OQVEMAWP6Y7YRGNR","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OQVEMAWP","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OQVEMAWP6Y7YRGNRQAJZOY3QGM","target":"record","payload":{"canonical_record":{"source":{"id":"1704.06979","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-04-23T20:48:43Z","cross_cats_sorted":[],"title_canon_sha256":"5d0f777fdac69a7c0aa0faa07c1e1b268b81548357acac807c4ecc14480357ac","abstract_canon_sha256":"acdb620bbf71a272742e21b8d4854bf8d6dc7a789accd82b761a358acb48b6d5"},"schema_version":"1.0"},"canonical_sha256":"742a4602cff63f8899b180139763703307d37cbfcbc8eab372d15bbb142992f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:55.158911Z","signature_b64":"NbTjm4eFTXkTelGqa8UEb0iW7JVqIgmEyErNhDYkfV7QKCWnq2O71Pp72dyY1kfx5SxFQoF25h+IjcNCuU6uCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"742a4602cff63f8899b180139763703307d37cbfcbc8eab372d15bbb142992f6","last_reissued_at":"2026-05-18T00:45:55.158268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:55.158268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.06979","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-18T00:45:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LNcdsaSl48Zsrss8JCW6dktnH+xh+F/4TtWaNo+7ozjHcpequzdu3489IkuMbEAsN7CK8KwyreM4H2oP5zMSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:44:25.600803Z"},"content_sha256":"24d2303b85d69294537267bdc25958015a7b77757ef4456890d5a2ee0b563f99","schema_version":"1.0","event_id":"sha256:24d2303b85d69294537267bdc25958015a7b77757ef4456890d5a2ee0b563f99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OQVEMAWP6Y7YRGNRQAJZOY3QGM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficiently Computing Real Roots of Sparse Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Gorav Jindal, Michael Sagraloff","submitted_at":"2017-04-23T20:48:43Z","abstract_excerpt":"We propose an efficient algorithm to compute the real roots of a sparse polynomial $f\\in\\mathbb{R}[x]$ having $k$ non-zero real-valued coefficients. It is assumed that arbitrarily good approximations of the non-zero coefficients are given by means of a coefficient oracle. For a given positive integer $L$, our algorithm returns disjoint disks $\\Delta_{1},\\ldots,\\Delta_{s}\\subset\\mathbb{C}$, with $s<2k$, centered at the real axis and of radius less than $2^{-L}$ together with positive integers $\\mu_{1},\\ldots,\\mu_{s}$ such that each disk $\\Delta_{i}$ contains exactly $\\mu_{i}$ roots of $f$ count"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06979","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-18T00:45:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+UcE0wge9xQAIxh9jvmxwkFICFE7qsLVCC0tUO5h988nrj1KEENg7G54Qd8ihzPy0sLYSod0sFx3aGLghKeGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:44:25.601153Z"},"content_sha256":"afa6ed56c01bf950fc63101412ea020e4b5d68589f924ef9f30b161077e3f3e9","schema_version":"1.0","event_id":"sha256:afa6ed56c01bf950fc63101412ea020e4b5d68589f924ef9f30b161077e3f3e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OQVEMAWP6Y7YRGNRQAJZOY3QGM/bundle.json","state_url":"https://pith.science/pith/OQVEMAWP6Y7YRGNRQAJZOY3QGM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OQVEMAWP6Y7YRGNRQAJZOY3QGM/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-05T14:44:25Z","links":{"resolver":"https://pith.science/pith/OQVEMAWP6Y7YRGNRQAJZOY3QGM","bundle":"https://pith.science/pith/OQVEMAWP6Y7YRGNRQAJZOY3QGM/bundle.json","state":"https://pith.science/pith/OQVEMAWP6Y7YRGNRQAJZOY3QGM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OQVEMAWP6Y7YRGNRQAJZOY3QGM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OQVEMAWP6Y7YRGNRQAJZOY3QGM","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":"acdb620bbf71a272742e21b8d4854bf8d6dc7a789accd82b761a358acb48b6d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-04-23T20:48:43Z","title_canon_sha256":"5d0f777fdac69a7c0aa0faa07c1e1b268b81548357acac807c4ecc14480357ac"},"schema_version":"1.0","source":{"id":"1704.06979","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06979","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06979v1","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06979","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"OQVEMAWP6Y7Y","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OQVEMAWP6Y7YRGNR","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OQVEMAWP","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:afa6ed56c01bf950fc63101412ea020e4b5d68589f924ef9f30b161077e3f3e9","target":"graph","created_at":"2026-05-18T00:45: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 propose an efficient algorithm to compute the real roots of a sparse polynomial $f\\in\\mathbb{R}[x]$ having $k$ non-zero real-valued coefficients. It is assumed that arbitrarily good approximations of the non-zero coefficients are given by means of a coefficient oracle. For a given positive integer $L$, our algorithm returns disjoint disks $\\Delta_{1},\\ldots,\\Delta_{s}\\subset\\mathbb{C}$, with $s<2k$, centered at the real axis and of radius less than $2^{-L}$ together with positive integers $\\mu_{1},\\ldots,\\mu_{s}$ such that each disk $\\Delta_{i}$ contains exactly $\\mu_{i}$ roots of $f$ count","authors_text":"Gorav Jindal, Michael Sagraloff","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-04-23T20:48:43Z","title":"Efficiently Computing Real Roots of Sparse Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06979","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:24d2303b85d69294537267bdc25958015a7b77757ef4456890d5a2ee0b563f99","target":"record","created_at":"2026-05-18T00:45: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":"acdb620bbf71a272742e21b8d4854bf8d6dc7a789accd82b761a358acb48b6d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-04-23T20:48:43Z","title_canon_sha256":"5d0f777fdac69a7c0aa0faa07c1e1b268b81548357acac807c4ecc14480357ac"},"schema_version":"1.0","source":{"id":"1704.06979","kind":"arxiv","version":1}},"canonical_sha256":"742a4602cff63f8899b180139763703307d37cbfcbc8eab372d15bbb142992f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"742a4602cff63f8899b180139763703307d37cbfcbc8eab372d15bbb142992f6","first_computed_at":"2026-05-18T00:45:55.158268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:55.158268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NbTjm4eFTXkTelGqa8UEb0iW7JVqIgmEyErNhDYkfV7QKCWnq2O71Pp72dyY1kfx5SxFQoF25h+IjcNCuU6uCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:55.158911Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.06979","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24d2303b85d69294537267bdc25958015a7b77757ef4456890d5a2ee0b563f99","sha256:afa6ed56c01bf950fc63101412ea020e4b5d68589f924ef9f30b161077e3f3e9"],"state_sha256":"3eb048ef7c56b1973382003258c57ae5a9b81a2e22970ee9da07b7a63e85e828"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k1dgeBb5xdRqPnXwX4nScgROpVuTEN7i7PVTPbEqAZF0bQ0tuSvX2MYpBdmcJ9X2oOQ6AR6Q3jDwyY1za3zwBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:44:25.603104Z","bundle_sha256":"1ebf9a814c41c7c818b6f8a9ac5365b8bb89a35e8a2407f67712e6eaf7730183"}}