{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:A4Q2NZBPRFHUB6YHTBTMLZR7U5","short_pith_number":"pith:A4Q2NZBP","canonical_record":{"source":{"id":"1104.1510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-04-08T07:56:51Z","cross_cats_sorted":[],"title_canon_sha256":"b077138ea8f4789347248555d88ed0fa3e8a38e24c2fde383fff040d4ae147fe","abstract_canon_sha256":"3308ea5ceebbb3afbbacb14e459f004e3f990bff3d3297baeb5f3ea9274391a4"},"schema_version":"1.0"},"canonical_sha256":"0721a6e42f894f40fb079866c5e63fa7443e3db4608e353588e9dbbda4f6cbfc","source":{"kind":"arxiv","id":"1104.1510","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1510","created_at":"2026-05-18T02:22:10Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1510v1","created_at":"2026-05-18T02:22:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1510","created_at":"2026-05-18T02:22:10Z"},{"alias_kind":"pith_short_12","alias_value":"A4Q2NZBPRFHU","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"A4Q2NZBPRFHUB6YH","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"A4Q2NZBP","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:A4Q2NZBPRFHUB6YHTBTMLZR7U5","target":"record","payload":{"canonical_record":{"source":{"id":"1104.1510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-04-08T07:56:51Z","cross_cats_sorted":[],"title_canon_sha256":"b077138ea8f4789347248555d88ed0fa3e8a38e24c2fde383fff040d4ae147fe","abstract_canon_sha256":"3308ea5ceebbb3afbbacb14e459f004e3f990bff3d3297baeb5f3ea9274391a4"},"schema_version":"1.0"},"canonical_sha256":"0721a6e42f894f40fb079866c5e63fa7443e3db4608e353588e9dbbda4f6cbfc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:10.368964Z","signature_b64":"Re/i0Hz5T8dz+DjD8DQNwx2K+nNpV4pZI68QNv4q/eVV4bOiaa0VhvgZkRdYJq2BqntDCexiMmtmA/tyZcTIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0721a6e42f894f40fb079866c5e63fa7443e3db4608e353588e9dbbda4f6cbfc","last_reissued_at":"2026-05-18T02:22:10.368488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:10.368488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.1510","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-18T02:22:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RJMck/Dg0b/MHHMGSZVDJQ+abOMPhuWQsBJymw0iPfSNXfJPykMvsvGMQMIJje9dr0M0tcujK3HqYn3szI5JAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T09:51:32.926163Z"},"content_sha256":"7b3eb36a79f2021ed45a86fcb76f3b721ffb933d298e919e3453f1bfd25135a7","schema_version":"1.0","event_id":"sha256:7b3eb36a79f2021ed45a86fcb76f3b721ffb933d298e919e3453f1bfd25135a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:A4Q2NZBPRFHUB6YHTBTMLZR7U5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Worst-case Bound for Topology Computation of Algebraic Curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Michael Kerber, Michael Sagraloff","submitted_at":"2011-04-08T07:56:51Z","abstract_excerpt":"Computing the topology of an algebraic plane curve $\\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\\mathcal{C}$ and thus represents its topology in $\\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with coefficients bounded by $2^\\rho$, the topology of the induced curve can be computed with $\\tilde{O}(n^8(n+\\rho^2))$ bit operations deterministically, and with $\\tilde{O}(n^8\\rho^2)$ bit operations with a randomized algorithm in expectation. Our analysis improves previous best known complexity bounds by a factor of $n^2$. The improvement is based on new tech"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1510","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-18T02:22:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BtH4Synt0jXeIpn9OmvhmJq3Rlq50bHNf2NC0FhX1m46r8JgCARqwYiLw69XtieGfG/gUtCS8zrOa+dW8K9SDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T09:51:32.926729Z"},"content_sha256":"3aa3838a27678df7fc6810cda0fb0698d2e85ccfa4b8d099955f9d2bfc33d760","schema_version":"1.0","event_id":"sha256:3aa3838a27678df7fc6810cda0fb0698d2e85ccfa4b8d099955f9d2bfc33d760"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4Q2NZBPRFHUB6YHTBTMLZR7U5/bundle.json","state_url":"https://pith.science/pith/A4Q2NZBPRFHUB6YHTBTMLZR7U5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4Q2NZBPRFHUB6YHTBTMLZR7U5/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-22T09:51:32Z","links":{"resolver":"https://pith.science/pith/A4Q2NZBPRFHUB6YHTBTMLZR7U5","bundle":"https://pith.science/pith/A4Q2NZBPRFHUB6YHTBTMLZR7U5/bundle.json","state":"https://pith.science/pith/A4Q2NZBPRFHUB6YHTBTMLZR7U5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4Q2NZBPRFHUB6YHTBTMLZR7U5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:A4Q2NZBPRFHUB6YHTBTMLZR7U5","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":"3308ea5ceebbb3afbbacb14e459f004e3f990bff3d3297baeb5f3ea9274391a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-04-08T07:56:51Z","title_canon_sha256":"b077138ea8f4789347248555d88ed0fa3e8a38e24c2fde383fff040d4ae147fe"},"schema_version":"1.0","source":{"id":"1104.1510","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1510","created_at":"2026-05-18T02:22:10Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1510v1","created_at":"2026-05-18T02:22:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1510","created_at":"2026-05-18T02:22:10Z"},{"alias_kind":"pith_short_12","alias_value":"A4Q2NZBPRFHU","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"A4Q2NZBPRFHUB6YH","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"A4Q2NZBP","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:3aa3838a27678df7fc6810cda0fb0698d2e85ccfa4b8d099955f9d2bfc33d760","target":"graph","created_at":"2026-05-18T02:22:10Z","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":"Computing the topology of an algebraic plane curve $\\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\\mathcal{C}$ and thus represents its topology in $\\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with coefficients bounded by $2^\\rho$, the topology of the induced curve can be computed with $\\tilde{O}(n^8(n+\\rho^2))$ bit operations deterministically, and with $\\tilde{O}(n^8\\rho^2)$ bit operations with a randomized algorithm in expectation. Our analysis improves previous best known complexity bounds by a factor of $n^2$. The improvement is based on new tech","authors_text":"Michael Kerber, Michael Sagraloff","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-04-08T07:56:51Z","title":"A Worst-case Bound for Topology Computation of Algebraic Curves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1510","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:7b3eb36a79f2021ed45a86fcb76f3b721ffb933d298e919e3453f1bfd25135a7","target":"record","created_at":"2026-05-18T02:22:10Z","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":"3308ea5ceebbb3afbbacb14e459f004e3f990bff3d3297baeb5f3ea9274391a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-04-08T07:56:51Z","title_canon_sha256":"b077138ea8f4789347248555d88ed0fa3e8a38e24c2fde383fff040d4ae147fe"},"schema_version":"1.0","source":{"id":"1104.1510","kind":"arxiv","version":1}},"canonical_sha256":"0721a6e42f894f40fb079866c5e63fa7443e3db4608e353588e9dbbda4f6cbfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0721a6e42f894f40fb079866c5e63fa7443e3db4608e353588e9dbbda4f6cbfc","first_computed_at":"2026-05-18T02:22:10.368488Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:10.368488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Re/i0Hz5T8dz+DjD8DQNwx2K+nNpV4pZI68QNv4q/eVV4bOiaa0VhvgZkRdYJq2BqntDCexiMmtmA/tyZcTIAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:10.368964Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.1510","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b3eb36a79f2021ed45a86fcb76f3b721ffb933d298e919e3453f1bfd25135a7","sha256:3aa3838a27678df7fc6810cda0fb0698d2e85ccfa4b8d099955f9d2bfc33d760"],"state_sha256":"beac35c48df5954696364e61ab8776a6bb691fb566a1a88fd2ece36c79950e08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tVdNIrpDXMHaU1oprncOmuubcvvrBo4iKSjnxOiMci8QiyNKmd3oOqcJ8EWlZXmCvgc5ynwHoT6da8xC9/psDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T09:51:32.930240Z","bundle_sha256":"a85c1b70209cf2eebde91c6ab12454812be03355e5ef6db4ea1804fd2d0d422a"}}