{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3YHIXYQUZUMDYWHL5PVJ3Y3WOD","short_pith_number":"pith:3YHIXYQU","canonical_record":{"source":{"id":"1309.5991","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-23T21:48:06Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"958e5dd217ad26b80435de3d708de5710e6f9768ba5e09c081a5828dd61d9238","abstract_canon_sha256":"e46ca6082731478fdcf2ce3773c32d9f30c29857d1671e5cbba439397e240c4a"},"schema_version":"1.0"},"canonical_sha256":"de0e8be214cd183c58ebebea9de37670f3312dee4775eccf0286384ee9675c6f","source":{"kind":"arxiv","id":"1309.5991","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5991","created_at":"2026-05-18T03:12:24Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5991v1","created_at":"2026-05-18T03:12:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5991","created_at":"2026-05-18T03:12:24Z"},{"alias_kind":"pith_short_12","alias_value":"3YHIXYQUZUMD","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3YHIXYQUZUMDYWHL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3YHIXYQU","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3YHIXYQUZUMDYWHL5PVJ3Y3WOD","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5991","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-23T21:48:06Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"958e5dd217ad26b80435de3d708de5710e6f9768ba5e09c081a5828dd61d9238","abstract_canon_sha256":"e46ca6082731478fdcf2ce3773c32d9f30c29857d1671e5cbba439397e240c4a"},"schema_version":"1.0"},"canonical_sha256":"de0e8be214cd183c58ebebea9de37670f3312dee4775eccf0286384ee9675c6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:24.484170Z","signature_b64":"HV38t0NZMZaP4voVlaHQWMpzV7fM5JIktAezpYu5R3KWxDpK/sPrCGONYHJgw5ekl87W/BloGYulK8hPmDTtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de0e8be214cd183c58ebebea9de37670f3312dee4775eccf0286384ee9675c6f","last_reissued_at":"2026-05-18T03:12:24.482794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:24.482794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5991","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:12:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O/tAjxP+0VMjJ6Sjwktapmthn01INZZbly9BUozqnwkS0ds4XKX1WYbSf65GO6BFatcZa6BDwuIZiI32l0GvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:59:14.318621Z"},"content_sha256":"2fe024099e98bf606fb53a78c4363fa155faa4544d190290838ba3f4c097e74a","schema_version":"1.0","event_id":"sha256:2fe024099e98bf606fb53a78c4363fa155faa4544d190290838ba3f4c097e74a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3YHIXYQUZUMDYWHL5PVJ3Y3WOD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Applications of Continuous Amortization to Bisection-based Root Isolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.DS","authors_text":"Michael A. Burr","submitted_at":"2013-09-23T21:48:06Z","abstract_excerpt":"Continuous amortization is a technique for computing the complexity of algorithms, and it was first presented by the author in Burr, Krahmer, & Yap (2009). Continuous amortization can result in simpler and more straight-forward complexity analyses, and it was used in Burr, Krahmer, & Yap (2009), Burr & Krahmer (2012), and Sharma & Yap (2012) to provide complexity bounds for simple root isolation algorithms. This paper greatly extends the reach of continuous amortization to serve as an overarching technique which can be used to compute complexity of many root isolation techniques in a straight-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5991","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:12:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M/Ev4xUqPg457rM+cm8PUYdzrsxot7bgxshzG9D07oji2j+mcl3AykP/tF2T7cIi/B11sRWuH9JcT+vTBgL5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:59:14.318951Z"},"content_sha256":"22ca58be948016a77deb236745cd2fa26496f3936e5673c72b82d673c79d7a59","schema_version":"1.0","event_id":"sha256:22ca58be948016a77deb236745cd2fa26496f3936e5673c72b82d673c79d7a59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YHIXYQUZUMDYWHL5PVJ3Y3WOD/bundle.json","state_url":"https://pith.science/pith/3YHIXYQUZUMDYWHL5PVJ3Y3WOD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YHIXYQUZUMDYWHL5PVJ3Y3WOD/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-26T15:59:14Z","links":{"resolver":"https://pith.science/pith/3YHIXYQUZUMDYWHL5PVJ3Y3WOD","bundle":"https://pith.science/pith/3YHIXYQUZUMDYWHL5PVJ3Y3WOD/bundle.json","state":"https://pith.science/pith/3YHIXYQUZUMDYWHL5PVJ3Y3WOD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YHIXYQUZUMDYWHL5PVJ3Y3WOD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3YHIXYQUZUMDYWHL5PVJ3Y3WOD","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":"e46ca6082731478fdcf2ce3773c32d9f30c29857d1671e5cbba439397e240c4a","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-23T21:48:06Z","title_canon_sha256":"958e5dd217ad26b80435de3d708de5710e6f9768ba5e09c081a5828dd61d9238"},"schema_version":"1.0","source":{"id":"1309.5991","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5991","created_at":"2026-05-18T03:12:24Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5991v1","created_at":"2026-05-18T03:12:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5991","created_at":"2026-05-18T03:12:24Z"},{"alias_kind":"pith_short_12","alias_value":"3YHIXYQUZUMD","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3YHIXYQUZUMDYWHL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3YHIXYQU","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:22ca58be948016a77deb236745cd2fa26496f3936e5673c72b82d673c79d7a59","target":"graph","created_at":"2026-05-18T03:12:24Z","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":"Continuous amortization is a technique for computing the complexity of algorithms, and it was first presented by the author in Burr, Krahmer, & Yap (2009). Continuous amortization can result in simpler and more straight-forward complexity analyses, and it was used in Burr, Krahmer, & Yap (2009), Burr & Krahmer (2012), and Sharma & Yap (2012) to provide complexity bounds for simple root isolation algorithms. This paper greatly extends the reach of continuous amortization to serve as an overarching technique which can be used to compute complexity of many root isolation techniques in a straight-","authors_text":"Michael A. Burr","cross_cats":["cs.SC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-23T21:48:06Z","title":"Applications of Continuous Amortization to Bisection-based Root Isolation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5991","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:2fe024099e98bf606fb53a78c4363fa155faa4544d190290838ba3f4c097e74a","target":"record","created_at":"2026-05-18T03:12:24Z","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":"e46ca6082731478fdcf2ce3773c32d9f30c29857d1671e5cbba439397e240c4a","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-23T21:48:06Z","title_canon_sha256":"958e5dd217ad26b80435de3d708de5710e6f9768ba5e09c081a5828dd61d9238"},"schema_version":"1.0","source":{"id":"1309.5991","kind":"arxiv","version":1}},"canonical_sha256":"de0e8be214cd183c58ebebea9de37670f3312dee4775eccf0286384ee9675c6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de0e8be214cd183c58ebebea9de37670f3312dee4775eccf0286384ee9675c6f","first_computed_at":"2026-05-18T03:12:24.482794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:24.482794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HV38t0NZMZaP4voVlaHQWMpzV7fM5JIktAezpYu5R3KWxDpK/sPrCGONYHJgw5ekl87W/BloGYulK8hPmDTtBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:24.484170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5991","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fe024099e98bf606fb53a78c4363fa155faa4544d190290838ba3f4c097e74a","sha256:22ca58be948016a77deb236745cd2fa26496f3936e5673c72b82d673c79d7a59"],"state_sha256":"cff8612de3c71d9a00502252879cd126239c6a996bda05e22928cbc4bdf6615d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8FYSeOlUub6vVqYYvWkJ7LslcPy0O+iZ8nwwDCjc2Pjtn0YgPwK15EDwCweY8Ov+x3sPVI11ml1Inc8/ZY6uBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T15:59:14.320870Z","bundle_sha256":"31884fe7fc1029b23e643e19686267f195a0390855be8eff6ba30c475c416641"}}