{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:OHIWND5JKBJELJSMXHRJL6VHAZ","short_pith_number":"pith:OHIWND5J","canonical_record":{"source":{"id":"0901.4400","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2009-01-28T05:15:07Z","cross_cats_sorted":["cs.CC","math.OC"],"title_canon_sha256":"517c5e3b4187b9c68f7cdcb50c1a4f07ccdb02128ccd82b390ce342c156b3d7b","abstract_canon_sha256":"bc7e868a205eee9866c549b6ecf8c98d877ed188006df883491cecb788cb7ef6"},"schema_version":"1.0"},"canonical_sha256":"71d1668fa9505245a64cb9e295faa70654b9f8a9dac60a9ae094adc9c45cfadf","source":{"kind":"arxiv","id":"0901.4400","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.4400","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"0901.4400v2","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.4400","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"OHIWND5JKBJE","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"OHIWND5JKBJELJSM","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"OHIWND5J","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:OHIWND5JKBJELJSMXHRJL6VHAZ","target":"record","payload":{"canonical_record":{"source":{"id":"0901.4400","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2009-01-28T05:15:07Z","cross_cats_sorted":["cs.CC","math.OC"],"title_canon_sha256":"517c5e3b4187b9c68f7cdcb50c1a4f07ccdb02128ccd82b390ce342c156b3d7b","abstract_canon_sha256":"bc7e868a205eee9866c549b6ecf8c98d877ed188006df883491cecb788cb7ef6"},"schema_version":"1.0"},"canonical_sha256":"71d1668fa9505245a64cb9e295faa70654b9f8a9dac60a9ae094adc9c45cfadf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:07.215994Z","signature_b64":"Sq51RABLef976iKqEkXUk/78UzEHxvVMds4QNY+Sv8sVCOorncsUdf5t3bPahY62G9fBvkEsWb6qVSnXItDjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71d1668fa9505245a64cb9e295faa70654b9f8a9dac60a9ae094adc9c45cfadf","last_reissued_at":"2026-05-18T03:14:07.215536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:07.215536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0901.4400","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-18T03:14:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T653uUENKVqavgxAhsHkon2PstYtTkuke5ASvw9Txf/vgB5s+vTwNvte4IZ/sUZ5KNc4iVxUmfKNBseHIWGUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:20:22.721907Z"},"content_sha256":"dc5d89815c88c717862ce66575b61f91690ca45f39c45347c72bf2a0c5a33f9e","schema_version":"1.0","event_id":"sha256:dc5d89815c88c717862ce66575b61f91690ca45f39c45347c72bf2a0c5a33f9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:OHIWND5JKBJELJSMXHRJL6VHAZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Real Feasibility via Circuit Discriminants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.OC"],"primary_cat":"math.AG","authors_text":"Casey Stella, Frederic Bihan, J. Maurice Rojas","submitted_at":"2009-01-28T05:15:07Z","abstract_excerpt":"We show that detecting real roots for honestly n-variate (n+2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any fixed n. The best previous complexity bounds were exponential in the sparse encoding, even for n fixed. We then give a characterization of those functions k(n) such that the complexity of detecting real roots for n-variate (n+k(n))-nomials transitions from P to NP-hardness as n tends to infinity. Our proofs follow in large part from a new complexity threshold for deciding the vanishing of A-discriminants of n-variate (n+k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.4400","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-18T03:14:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tixmvO3bGV9ZwA0DwMYYDUVOf2Tje37Gbst9oPSf7H8numIOc61Vm+nDtYlG3+w90LGtFQljg2XM+MdUhTEMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:20:22.722636Z"},"content_sha256":"4322c0e32581bb58e356aa4a704ada8e4fee20e218428bd236b35dcf692d0514","schema_version":"1.0","event_id":"sha256:4322c0e32581bb58e356aa4a704ada8e4fee20e218428bd236b35dcf692d0514"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OHIWND5JKBJELJSMXHRJL6VHAZ/bundle.json","state_url":"https://pith.science/pith/OHIWND5JKBJELJSMXHRJL6VHAZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OHIWND5JKBJELJSMXHRJL6VHAZ/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-08T05:20:22Z","links":{"resolver":"https://pith.science/pith/OHIWND5JKBJELJSMXHRJL6VHAZ","bundle":"https://pith.science/pith/OHIWND5JKBJELJSMXHRJL6VHAZ/bundle.json","state":"https://pith.science/pith/OHIWND5JKBJELJSMXHRJL6VHAZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OHIWND5JKBJELJSMXHRJL6VHAZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:OHIWND5JKBJELJSMXHRJL6VHAZ","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":"bc7e868a205eee9866c549b6ecf8c98d877ed188006df883491cecb788cb7ef6","cross_cats_sorted":["cs.CC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2009-01-28T05:15:07Z","title_canon_sha256":"517c5e3b4187b9c68f7cdcb50c1a4f07ccdb02128ccd82b390ce342c156b3d7b"},"schema_version":"1.0","source":{"id":"0901.4400","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.4400","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"0901.4400v2","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.4400","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"OHIWND5JKBJE","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"OHIWND5JKBJELJSM","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"OHIWND5J","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:4322c0e32581bb58e356aa4a704ada8e4fee20e218428bd236b35dcf692d0514","target":"graph","created_at":"2026-05-18T03:14:07Z","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 show that detecting real roots for honestly n-variate (n+2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any fixed n. The best previous complexity bounds were exponential in the sparse encoding, even for n fixed. We then give a characterization of those functions k(n) such that the complexity of detecting real roots for n-variate (n+k(n))-nomials transitions from P to NP-hardness as n tends to infinity. Our proofs follow in large part from a new complexity threshold for deciding the vanishing of A-discriminants of n-variate (n+k","authors_text":"Casey Stella, Frederic Bihan, J. Maurice Rojas","cross_cats":["cs.CC","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2009-01-28T05:15:07Z","title":"Faster Real Feasibility via Circuit Discriminants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.4400","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:dc5d89815c88c717862ce66575b61f91690ca45f39c45347c72bf2a0c5a33f9e","target":"record","created_at":"2026-05-18T03:14:07Z","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":"bc7e868a205eee9866c549b6ecf8c98d877ed188006df883491cecb788cb7ef6","cross_cats_sorted":["cs.CC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2009-01-28T05:15:07Z","title_canon_sha256":"517c5e3b4187b9c68f7cdcb50c1a4f07ccdb02128ccd82b390ce342c156b3d7b"},"schema_version":"1.0","source":{"id":"0901.4400","kind":"arxiv","version":2}},"canonical_sha256":"71d1668fa9505245a64cb9e295faa70654b9f8a9dac60a9ae094adc9c45cfadf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71d1668fa9505245a64cb9e295faa70654b9f8a9dac60a9ae094adc9c45cfadf","first_computed_at":"2026-05-18T03:14:07.215536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:07.215536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sq51RABLef976iKqEkXUk/78UzEHxvVMds4QNY+Sv8sVCOorncsUdf5t3bPahY62G9fBvkEsWb6qVSnXItDjAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:07.215994Z","signed_message":"canonical_sha256_bytes"},"source_id":"0901.4400","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc5d89815c88c717862ce66575b61f91690ca45f39c45347c72bf2a0c5a33f9e","sha256:4322c0e32581bb58e356aa4a704ada8e4fee20e218428bd236b35dcf692d0514"],"state_sha256":"781332c61ceb0bb4c479ae1289299612f33788107ecd748627ba0b4991d5a420"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d12JCxNV5MCeSrzIPLmYrlcoClptmnybMiMgnccwHh2ihfUZzuwIER1nU7QytiFAIuF9WuNFVqwGsVERqJkRDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T05:20:22.727163Z","bundle_sha256":"c6a307345752b142667d2566c3ef5032b595f9d24a11ba819fd4ec6ed36061b1"}}