{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PK5VU332BN7RUHFKSC6POWVB7B","short_pith_number":"pith:PK5VU332","canonical_record":{"source":{"id":"1101.2642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2011-01-13T19:44:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a0bed28ba2f2bf6d683f169809d4ecdaac12e156bc1b0b2425b43f38a0f12d03","abstract_canon_sha256":"4bd68895303c5f9cdef4a4329fe6f3038ff243ee729c30fcd6ab076dc3dd9df0"},"schema_version":"1.0"},"canonical_sha256":"7abb5a6f7a0b7f1a1caa90bcf75aa1f86f8312da3479d52add7cc36e197ad6cb","source":{"kind":"arxiv","id":"1101.2642","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2642","created_at":"2026-05-18T03:14:30Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2642v1","created_at":"2026-05-18T03:14:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2642","created_at":"2026-05-18T03:14:30Z"},{"alias_kind":"pith_short_12","alias_value":"PK5VU332BN7R","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PK5VU332BN7RUHFK","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PK5VU332","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PK5VU332BN7RUHFKSC6POWVB7B","target":"record","payload":{"canonical_record":{"source":{"id":"1101.2642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2011-01-13T19:44:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a0bed28ba2f2bf6d683f169809d4ecdaac12e156bc1b0b2425b43f38a0f12d03","abstract_canon_sha256":"4bd68895303c5f9cdef4a4329fe6f3038ff243ee729c30fcd6ab076dc3dd9df0"},"schema_version":"1.0"},"canonical_sha256":"7abb5a6f7a0b7f1a1caa90bcf75aa1f86f8312da3479d52add7cc36e197ad6cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:30.642027Z","signature_b64":"71WLG6lyW1fHyeoAnejce3tjcDbVqB5BZHXhcBf2Tualt+7cq4pRmEc0tAzQJo/PnH7uds4DkrfT6IeWomwuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7abb5a6f7a0b7f1a1caa90bcf75aa1f86f8312da3479d52add7cc36e197ad6cb","last_reissued_at":"2026-05-18T03:14:30.641140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:30.641140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.2642","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-18T03:14:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QdFvEOndFYna2SqaR1eEMhnPxX1LUt2XrDPVh6uBJ+lPfliHx3tDcil2OAOemXS5Q3GRCn7h8fJMsCM54TG2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:03:26.968828Z"},"content_sha256":"767cf72c513096c232ebf611a5826c048123fa2c60c65ae69657ed49ddbc864a","schema_version":"1.0","event_id":"sha256:767cf72c513096c232ebf611a5826c048123fa2c60c65ae69657ed49ddbc864a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PK5VU332BN7RUHFKSC6POWVB7B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomization, Sums of Squares, and Faster Real Root Counting for Tetranomials and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.AG","authors_text":"Christopher J. Hillar, Dimitar Popov, J. Maurice Rojas, Osbert Bastani","submitted_at":"2011-01-13T19:44:50Z","abstract_excerpt":"Suppose f is a real univariate polynomial of degree D with exactly 4 monomial terms. We present an algorithm, with complexity polynomial in log D on average (relative to the stable log-uniform measure), for counting the number of real roots of f. The best previous algorithms had complexity super-linear in D. We also discuss connections to sums of squares and A-discriminants, including explicit obstructions to expressing positive definite sparse polynomials as sums of squares of few sparse polynomials. Our key tool is the introduction of efficiently computable chamber cones, bounding regions in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2642","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-18T03:14:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rawi2vkdp5F3iMmWDOvGNXBcXgDnVF/5MzRrvygt7Qdr+/4SHEbOtb7lY/TnYMkPKTCLn3mnh7EQAE6cXYrpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:03:26.969388Z"},"content_sha256":"ab3c9feb6c78f6b60e879b339eeb278200d1c78fc9c96c46a948e4d4289cfe0f","schema_version":"1.0","event_id":"sha256:ab3c9feb6c78f6b60e879b339eeb278200d1c78fc9c96c46a948e4d4289cfe0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PK5VU332BN7RUHFKSC6POWVB7B/bundle.json","state_url":"https://pith.science/pith/PK5VU332BN7RUHFKSC6POWVB7B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PK5VU332BN7RUHFKSC6POWVB7B/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-25T12:03:26Z","links":{"resolver":"https://pith.science/pith/PK5VU332BN7RUHFKSC6POWVB7B","bundle":"https://pith.science/pith/PK5VU332BN7RUHFKSC6POWVB7B/bundle.json","state":"https://pith.science/pith/PK5VU332BN7RUHFKSC6POWVB7B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PK5VU332BN7RUHFKSC6POWVB7B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PK5VU332BN7RUHFKSC6POWVB7B","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":"4bd68895303c5f9cdef4a4329fe6f3038ff243ee729c30fcd6ab076dc3dd9df0","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2011-01-13T19:44:50Z","title_canon_sha256":"a0bed28ba2f2bf6d683f169809d4ecdaac12e156bc1b0b2425b43f38a0f12d03"},"schema_version":"1.0","source":{"id":"1101.2642","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2642","created_at":"2026-05-18T03:14:30Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2642v1","created_at":"2026-05-18T03:14:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2642","created_at":"2026-05-18T03:14:30Z"},{"alias_kind":"pith_short_12","alias_value":"PK5VU332BN7R","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PK5VU332BN7RUHFK","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PK5VU332","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:ab3c9feb6c78f6b60e879b339eeb278200d1c78fc9c96c46a948e4d4289cfe0f","target":"graph","created_at":"2026-05-18T03:14:30Z","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":"Suppose f is a real univariate polynomial of degree D with exactly 4 monomial terms. We present an algorithm, with complexity polynomial in log D on average (relative to the stable log-uniform measure), for counting the number of real roots of f. The best previous algorithms had complexity super-linear in D. We also discuss connections to sums of squares and A-discriminants, including explicit obstructions to expressing positive definite sparse polynomials as sums of squares of few sparse polynomials. Our key tool is the introduction of efficiently computable chamber cones, bounding regions in","authors_text":"Christopher J. Hillar, Dimitar Popov, J. Maurice Rojas, Osbert Bastani","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2011-01-13T19:44:50Z","title":"Randomization, Sums of Squares, and Faster Real Root Counting for Tetranomials and Beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2642","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:767cf72c513096c232ebf611a5826c048123fa2c60c65ae69657ed49ddbc864a","target":"record","created_at":"2026-05-18T03:14:30Z","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":"4bd68895303c5f9cdef4a4329fe6f3038ff243ee729c30fcd6ab076dc3dd9df0","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2011-01-13T19:44:50Z","title_canon_sha256":"a0bed28ba2f2bf6d683f169809d4ecdaac12e156bc1b0b2425b43f38a0f12d03"},"schema_version":"1.0","source":{"id":"1101.2642","kind":"arxiv","version":1}},"canonical_sha256":"7abb5a6f7a0b7f1a1caa90bcf75aa1f86f8312da3479d52add7cc36e197ad6cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7abb5a6f7a0b7f1a1caa90bcf75aa1f86f8312da3479d52add7cc36e197ad6cb","first_computed_at":"2026-05-18T03:14:30.641140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:30.641140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"71WLG6lyW1fHyeoAnejce3tjcDbVqB5BZHXhcBf2Tualt+7cq4pRmEc0tAzQJo/PnH7uds4DkrfT6IeWomwuAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:30.642027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.2642","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:767cf72c513096c232ebf611a5826c048123fa2c60c65ae69657ed49ddbc864a","sha256:ab3c9feb6c78f6b60e879b339eeb278200d1c78fc9c96c46a948e4d4289cfe0f"],"state_sha256":"067ae4054a267992d7ad1769f06f08c237c90e229967ab69ee262135840acf51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JI6cf3k2GNWf61+ULqDsfWcdEq5BFAPxW17IDwb1vjS6ajIJSd7Rmrhvr1N6xGkQ4tT1kIIqxQXI4JqertXDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:03:26.971968Z","bundle_sha256":"ff2589570f97337be54d7b8422157e72ab6e42b427d94c18e8c995d54c92fb33"}}