{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DXGAITPPQ4D4MPZ6W67KV3G6XI","short_pith_number":"pith:DXGAITPP","canonical_record":{"source":{"id":"1401.5690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-01-22T14:54:13Z","cross_cats_sorted":["cs.NA","math.AG","math.GT","math.NA"],"title_canon_sha256":"54040a9b75bc9298e3764cae00f6a522c1ade7a49a5a0450aa3e6bdab99c9f24","abstract_canon_sha256":"1b479c26093e4e4baedbfeca4d2e5a087ad0682bf3b933b8330097e177c97b5e"},"schema_version":"1.0"},"canonical_sha256":"1dcc044def8707c63f3eb7beaaecdeba10cea310f2af860d379baa63fcbb7240","source":{"kind":"arxiv","id":"1401.5690","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5690","created_at":"2026-05-18T02:46:12Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5690v2","created_at":"2026-05-18T02:46:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5690","created_at":"2026-05-18T02:46:12Z"},{"alias_kind":"pith_short_12","alias_value":"DXGAITPPQ4D4","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DXGAITPPQ4D4MPZ6","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DXGAITPP","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DXGAITPPQ4D4MPZ6W67KV3G6XI","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-01-22T14:54:13Z","cross_cats_sorted":["cs.NA","math.AG","math.GT","math.NA"],"title_canon_sha256":"54040a9b75bc9298e3764cae00f6a522c1ade7a49a5a0450aa3e6bdab99c9f24","abstract_canon_sha256":"1b479c26093e4e4baedbfeca4d2e5a087ad0682bf3b933b8330097e177c97b5e"},"schema_version":"1.0"},"canonical_sha256":"1dcc044def8707c63f3eb7beaaecdeba10cea310f2af860d379baa63fcbb7240","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:12.830541Z","signature_b64":"Qp1rdHDh7pxBUINc+f7+41Ffv2hDKffRrtkX5IkT/If5OYjaOWv3bImc3MJ70SqOekhSGfmoQ0AKDwqol9M/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dcc044def8707c63f3eb7beaaecdeba10cea310f2af860d379baa63fcbb7240","last_reissued_at":"2026-05-18T02:46:12.829871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:12.829871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5690","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-18T02:46:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZN8Xs7P3TKHD1djYxL2aS4vKe/n5YRCy9NKisl2Vudta/e9lwghrCDif5UcbnDwUJDwlLJvOa4fBgD10Pm7DDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T08:00:04.832440Z"},"content_sha256":"ca7d4728da3cb2bf4854fc0ca0c9974138b93a19336254ad0ee16088a9c9f9f0","schema_version":"1.0","event_id":"sha256:ca7d4728da3cb2bf4854fc0ca0c9974138b93a19336254ad0ee16088a9c9f9f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DXGAITPPQ4D4MPZ6W67KV3G6XI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Computing with Planar Algebraic Curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.AG","math.GT","math.NA"],"primary_cat":"cs.SC","authors_text":"Alexander Kobel, Michael Sagraloff","submitted_at":"2014-01-22T14:54:13Z","abstract_excerpt":"In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials $f$, $g \\in \\mathbb{Z}[x,y]$ and an arbitrary polynomial $h \\in \\mathbb{Z}[x,y]$, each of total degree less than $n$ and with integer coefficients of absolute value less than $2^\\tau$, we show that each of the following problems can be solved in a deterministic way with a number of bit operations bounded by $\\tilde{O}(n^6+n^5\\tau)$, where we ignore polylogarithmic factors in $n$ and $\\tau$:\n  (1) The computation of isolating reg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5690","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-18T02:46:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LDYGjrSzsZDS9U1IIp+JfGTJWWfpsi2N4gpXJkmJbvFk4rHcssbY2IEOxJjkt8O3w6me6JBDmsactO90c6DlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T08:00:04.832796Z"},"content_sha256":"0b7e56b4ea1f112f94b2ea2ff15ee4dae1da3c96e8c9882d76014b523b5ea956","schema_version":"1.0","event_id":"sha256:0b7e56b4ea1f112f94b2ea2ff15ee4dae1da3c96e8c9882d76014b523b5ea956"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXGAITPPQ4D4MPZ6W67KV3G6XI/bundle.json","state_url":"https://pith.science/pith/DXGAITPPQ4D4MPZ6W67KV3G6XI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXGAITPPQ4D4MPZ6W67KV3G6XI/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-22T08:00:04Z","links":{"resolver":"https://pith.science/pith/DXGAITPPQ4D4MPZ6W67KV3G6XI","bundle":"https://pith.science/pith/DXGAITPPQ4D4MPZ6W67KV3G6XI/bundle.json","state":"https://pith.science/pith/DXGAITPPQ4D4MPZ6W67KV3G6XI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXGAITPPQ4D4MPZ6W67KV3G6XI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DXGAITPPQ4D4MPZ6W67KV3G6XI","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":"1b479c26093e4e4baedbfeca4d2e5a087ad0682bf3b933b8330097e177c97b5e","cross_cats_sorted":["cs.NA","math.AG","math.GT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-01-22T14:54:13Z","title_canon_sha256":"54040a9b75bc9298e3764cae00f6a522c1ade7a49a5a0450aa3e6bdab99c9f24"},"schema_version":"1.0","source":{"id":"1401.5690","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5690","created_at":"2026-05-18T02:46:12Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5690v2","created_at":"2026-05-18T02:46:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5690","created_at":"2026-05-18T02:46:12Z"},{"alias_kind":"pith_short_12","alias_value":"DXGAITPPQ4D4","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DXGAITPPQ4D4MPZ6","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DXGAITPP","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:0b7e56b4ea1f112f94b2ea2ff15ee4dae1da3c96e8c9882d76014b523b5ea956","target":"graph","created_at":"2026-05-18T02:46:12Z","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":"In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials $f$, $g \\in \\mathbb{Z}[x,y]$ and an arbitrary polynomial $h \\in \\mathbb{Z}[x,y]$, each of total degree less than $n$ and with integer coefficients of absolute value less than $2^\\tau$, we show that each of the following problems can be solved in a deterministic way with a number of bit operations bounded by $\\tilde{O}(n^6+n^5\\tau)$, where we ignore polylogarithmic factors in $n$ and $\\tau$:\n  (1) The computation of isolating reg","authors_text":"Alexander Kobel, Michael Sagraloff","cross_cats":["cs.NA","math.AG","math.GT","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-01-22T14:54:13Z","title":"On the Complexity of Computing with Planar Algebraic Curves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5690","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:ca7d4728da3cb2bf4854fc0ca0c9974138b93a19336254ad0ee16088a9c9f9f0","target":"record","created_at":"2026-05-18T02:46:12Z","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":"1b479c26093e4e4baedbfeca4d2e5a087ad0682bf3b933b8330097e177c97b5e","cross_cats_sorted":["cs.NA","math.AG","math.GT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-01-22T14:54:13Z","title_canon_sha256":"54040a9b75bc9298e3764cae00f6a522c1ade7a49a5a0450aa3e6bdab99c9f24"},"schema_version":"1.0","source":{"id":"1401.5690","kind":"arxiv","version":2}},"canonical_sha256":"1dcc044def8707c63f3eb7beaaecdeba10cea310f2af860d379baa63fcbb7240","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dcc044def8707c63f3eb7beaaecdeba10cea310f2af860d379baa63fcbb7240","first_computed_at":"2026-05-18T02:46:12.829871Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:12.829871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qp1rdHDh7pxBUINc+f7+41Ffv2hDKffRrtkX5IkT/If5OYjaOWv3bImc3MJ70SqOekhSGfmoQ0AKDwqol9M/Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:12.830541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5690","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca7d4728da3cb2bf4854fc0ca0c9974138b93a19336254ad0ee16088a9c9f9f0","sha256:0b7e56b4ea1f112f94b2ea2ff15ee4dae1da3c96e8c9882d76014b523b5ea956"],"state_sha256":"8b5d190c2d90dd0f4e8d187d1c001f348fba52ea8698b12e80ceb4261ffb57e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ISy1MIv3UlcyaHbFjEDJWY4vFQStIKNu0ZKc1Rpl8jv+CdmSi/glDJePnaap8eNhmIaSUFpXS2W0bIti4iuyDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T08:00:04.835023Z","bundle_sha256":"74979f13bbed36b670d1a844190cecae9034fefbebe7e427353d136c5ec01f4c"}}