{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ARBJYO4Z2PD3VSD7PW2IAY65HT","short_pith_number":"pith:ARBJYO4Z","canonical_record":{"source":{"id":"1209.3555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-09-17T05:27:33Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"be937484278b8145576d9f5e1be40cf9e6e4302f605366b882f11737abe1b6c7","abstract_canon_sha256":"e05eaf48ef1c3fda6aeff32fffd127d67e2e670768a6754bb6c4e5bdbcbf53fa"},"schema_version":"1.0"},"canonical_sha256":"04429c3b99d3c7bac87f7db48063dd3cfc42fd9ba62d2e11c85d5bdbf24f5ca3","source":{"kind":"arxiv","id":"1209.3555","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3555","created_at":"2026-05-18T03:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3555v1","created_at":"2026-05-18T03:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3555","created_at":"2026-05-18T03:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"ARBJYO4Z2PD3","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"ARBJYO4Z2PD3VSD7","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"ARBJYO4Z","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ARBJYO4Z2PD3VSD7PW2IAY65HT","target":"record","payload":{"canonical_record":{"source":{"id":"1209.3555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-09-17T05:27:33Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"be937484278b8145576d9f5e1be40cf9e6e4302f605366b882f11737abe1b6c7","abstract_canon_sha256":"e05eaf48ef1c3fda6aeff32fffd127d67e2e670768a6754bb6c4e5bdbcbf53fa"},"schema_version":"1.0"},"canonical_sha256":"04429c3b99d3c7bac87f7db48063dd3cfc42fd9ba62d2e11c85d5bdbf24f5ca3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:30.653938Z","signature_b64":"x5o0luXAhZ3Qebn1hBjhn7zxI2AOWy1Chw8fqyrmimftrktHLRHTgFbLIXEKZ1J5bpdTQwFrLsjb4bbGZfg2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04429c3b99d3c7bac87f7db48063dd3cfc42fd9ba62d2e11c85d5bdbf24f5ca3","last_reissued_at":"2026-05-18T03:45:30.653269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:30.653269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.3555","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:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pkjLM31yeYREIFxOrF08boLxRizFt0PSW1wnwu0CtUReItyXtmpm/LFQvsGGX4xkxjBUW+Sewt6u2ayN4pqECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:31:56.627712Z"},"content_sha256":"bd20dfdbdc5a4374d3d2d51f75dd14f467b8b69a221bd9c3e614dbd4f0a1de31","schema_version":"1.0","event_id":"sha256:bd20dfdbdc5a4374d3d2d51f75dd14f467b8b69a221bd9c3e614dbd4f0a1de31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ARBJYO4Z2PD3VSD7PW2IAY65HT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"logcf: An Efficient Tool for Real Root Isolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"cs.SC","authors_text":"Bican Xia, Liyun Dai","submitted_at":"2012-09-17T05:27:33Z","abstract_excerpt":"This paper revisits an algorithm for isolating real roots of univariate polynomials based on continued fractions. It follows the work of Vincent, Uspen- sky, Collins and Akritas, Johnson and Krandick. We use some tricks, especially a new algorithm for computing an upper bound of positive roots. In this way, the algorithm of isolating real roots is improved. The complexity of our method for computing an upper bound of positive roots is O(n log(u+1)) where u is the optimal upper bound satisfying Theorem 3 and n is the degree of the polynomial. Our method has been implemented as a software packag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3555","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:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Fxm6JY7xEZmf2a0qG9WHsg9kEv9b+vH0/psTZG3hG6JlmF/2lQVt7Tq8HOByRVrT3K0F7apiqqOfflBqIJbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:31:56.628350Z"},"content_sha256":"9b99f067c0d7f53f66bca0e05b1f7b1cf50a92a62c9c743ec01d64b93e852e16","schema_version":"1.0","event_id":"sha256:9b99f067c0d7f53f66bca0e05b1f7b1cf50a92a62c9c743ec01d64b93e852e16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ARBJYO4Z2PD3VSD7PW2IAY65HT/bundle.json","state_url":"https://pith.science/pith/ARBJYO4Z2PD3VSD7PW2IAY65HT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ARBJYO4Z2PD3VSD7PW2IAY65HT/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-26T22:31:56Z","links":{"resolver":"https://pith.science/pith/ARBJYO4Z2PD3VSD7PW2IAY65HT","bundle":"https://pith.science/pith/ARBJYO4Z2PD3VSD7PW2IAY65HT/bundle.json","state":"https://pith.science/pith/ARBJYO4Z2PD3VSD7PW2IAY65HT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ARBJYO4Z2PD3VSD7PW2IAY65HT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ARBJYO4Z2PD3VSD7PW2IAY65HT","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":"e05eaf48ef1c3fda6aeff32fffd127d67e2e670768a6754bb6c4e5bdbcbf53fa","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-09-17T05:27:33Z","title_canon_sha256":"be937484278b8145576d9f5e1be40cf9e6e4302f605366b882f11737abe1b6c7"},"schema_version":"1.0","source":{"id":"1209.3555","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3555","created_at":"2026-05-18T03:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3555v1","created_at":"2026-05-18T03:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3555","created_at":"2026-05-18T03:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"ARBJYO4Z2PD3","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"ARBJYO4Z2PD3VSD7","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"ARBJYO4Z","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:9b99f067c0d7f53f66bca0e05b1f7b1cf50a92a62c9c743ec01d64b93e852e16","target":"graph","created_at":"2026-05-18T03:45: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":"This paper revisits an algorithm for isolating real roots of univariate polynomials based on continued fractions. It follows the work of Vincent, Uspen- sky, Collins and Akritas, Johnson and Krandick. We use some tricks, especially a new algorithm for computing an upper bound of positive roots. In this way, the algorithm of isolating real roots is improved. The complexity of our method for computing an upper bound of positive roots is O(n log(u+1)) where u is the optimal upper bound satisfying Theorem 3 and n is the degree of the polynomial. Our method has been implemented as a software packag","authors_text":"Bican Xia, Liyun Dai","cross_cats":["math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-09-17T05:27:33Z","title":"logcf: An Efficient Tool for Real Root Isolation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3555","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:bd20dfdbdc5a4374d3d2d51f75dd14f467b8b69a221bd9c3e614dbd4f0a1de31","target":"record","created_at":"2026-05-18T03:45: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":"e05eaf48ef1c3fda6aeff32fffd127d67e2e670768a6754bb6c4e5bdbcbf53fa","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-09-17T05:27:33Z","title_canon_sha256":"be937484278b8145576d9f5e1be40cf9e6e4302f605366b882f11737abe1b6c7"},"schema_version":"1.0","source":{"id":"1209.3555","kind":"arxiv","version":1}},"canonical_sha256":"04429c3b99d3c7bac87f7db48063dd3cfc42fd9ba62d2e11c85d5bdbf24f5ca3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04429c3b99d3c7bac87f7db48063dd3cfc42fd9ba62d2e11c85d5bdbf24f5ca3","first_computed_at":"2026-05-18T03:45:30.653269Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:30.653269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x5o0luXAhZ3Qebn1hBjhn7zxI2AOWy1Chw8fqyrmimftrktHLRHTgFbLIXEKZ1J5bpdTQwFrLsjb4bbGZfg2Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:30.653938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.3555","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd20dfdbdc5a4374d3d2d51f75dd14f467b8b69a221bd9c3e614dbd4f0a1de31","sha256:9b99f067c0d7f53f66bca0e05b1f7b1cf50a92a62c9c743ec01d64b93e852e16"],"state_sha256":"cbc6351dd85eb01e4fe6532cc07c9de6f92917cd1a54d471797331653d9d540f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmT81xVOi4aGZiYSlabzsUKN106mps1U5Qoe0BqsNDKsi2T/c1V23nBBh1v0ueKdE/7yaHKuQszzA7sRufLyDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:31:56.631723Z","bundle_sha256":"a8048762c9620310519119be3e3886c78a22eab122183083b2a308abdbf2ef3d"}}