{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:I6ZVQF7HVWKXHT7O3TTHJNOIXQ","short_pith_number":"pith:I6ZVQF7H","canonical_record":{"source":{"id":"1712.05487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-12-15T00:33:30Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"8ef68871fd25166da4eac7aa4ce5a6aa16ac27702e7420c50ce4f2d729ba9e03","abstract_canon_sha256":"986a721b2bc04bb167634fe56102d7cd167bd89dc45d69502c1025287bfc6265"},"schema_version":"1.0"},"canonical_sha256":"47b35817e7ad9573cfeedce674b5c8bc15ff348d847e3d2be96ed436142c027e","source":{"kind":"arxiv","id":"1712.05487","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05487","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05487v1","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05487","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"I6ZVQF7HVWKX","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I6ZVQF7HVWKXHT7O","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I6ZVQF7H","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:I6ZVQF7HVWKXHT7O3TTHJNOIXQ","target":"record","payload":{"canonical_record":{"source":{"id":"1712.05487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-12-15T00:33:30Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"8ef68871fd25166da4eac7aa4ce5a6aa16ac27702e7420c50ce4f2d729ba9e03","abstract_canon_sha256":"986a721b2bc04bb167634fe56102d7cd167bd89dc45d69502c1025287bfc6265"},"schema_version":"1.0"},"canonical_sha256":"47b35817e7ad9573cfeedce674b5c8bc15ff348d847e3d2be96ed436142c027e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:56.296676Z","signature_b64":"Wb5oDju783E4pb4UAhdffa6Eq5o8Vev6vcRB0lNT4lmmzmkh2+PXTWb/RZNr9haYI1t9TVpyRnRIshiBqJ1sDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47b35817e7ad9573cfeedce674b5c8bc15ff348d847e3d2be96ed436142c027e","last_reissued_at":"2026-05-18T00:27:56.295968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:56.295968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.05487","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-18T00:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3QbOsd4H4iu616K2NChI+LPZWjzdL/vGzm0GxY+9HPCLvMctenL8GBRrfq+5aHADkvXod3+pBbsRW2gQnBR5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T19:59:06.328016Z"},"content_sha256":"3e903c56a3130faef15149cc4d5c97425336bc9e26daaec3991189eb9325f12d","schema_version":"1.0","event_id":"sha256:3e903c56a3130faef15149cc4d5c97425336bc9e26daaec3991189eb9325f12d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:I6ZVQF7HVWKXHT7O3TTHJNOIXQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Solutions of a Polynomial System Locally and Exactly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.SC","authors_text":"Michael Sagraloff, Ruben Becker","submitted_at":"2017-12-15T00:33:30Z","abstract_excerpt":"We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system within a local region. More specifically, given a zero-dimensional system $f_1=\\cdots=f_n=0$, with $f_i\\in\\mathbb{C}[x_1,\\ldots,x_n]$, and a polydisc $\\mathbf{\\Delta}\\subset\\mathbb{C}^n$, our method aims to certify the existence of $k$ solutions (counted with multiplicity) within the polydisc.\n  In case of success, it yields the correct result under guarantee. Otherwise, no information is given. However, we show that our algorithm always succeeds if $\\mathbf{\\Delta}$ is sufficiently small and well-i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05487","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-18T00:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cNr3O14QaD+zlwC5kLrrVOOStpgZhZIE+ikJB7Hq3bZxEszGX/tXbKPT8E1Hw1jySYZQGKnNfQMnsVkaOABDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T19:59:06.328404Z"},"content_sha256":"114f9abd7b0c345202788ac021d95e657c90553e39525e7fc4c56d728409aa50","schema_version":"1.0","event_id":"sha256:114f9abd7b0c345202788ac021d95e657c90553e39525e7fc4c56d728409aa50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I6ZVQF7HVWKXHT7O3TTHJNOIXQ/bundle.json","state_url":"https://pith.science/pith/I6ZVQF7HVWKXHT7O3TTHJNOIXQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I6ZVQF7HVWKXHT7O3TTHJNOIXQ/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-21T19:59:06Z","links":{"resolver":"https://pith.science/pith/I6ZVQF7HVWKXHT7O3TTHJNOIXQ","bundle":"https://pith.science/pith/I6ZVQF7HVWKXHT7O3TTHJNOIXQ/bundle.json","state":"https://pith.science/pith/I6ZVQF7HVWKXHT7O3TTHJNOIXQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I6ZVQF7HVWKXHT7O3TTHJNOIXQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:I6ZVQF7HVWKXHT7O3TTHJNOIXQ","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":"986a721b2bc04bb167634fe56102d7cd167bd89dc45d69502c1025287bfc6265","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-12-15T00:33:30Z","title_canon_sha256":"8ef68871fd25166da4eac7aa4ce5a6aa16ac27702e7420c50ce4f2d729ba9e03"},"schema_version":"1.0","source":{"id":"1712.05487","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05487","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05487v1","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05487","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"I6ZVQF7HVWKX","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I6ZVQF7HVWKXHT7O","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I6ZVQF7H","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:114f9abd7b0c345202788ac021d95e657c90553e39525e7fc4c56d728409aa50","target":"graph","created_at":"2026-05-18T00:27:56Z","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 propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system within a local region. More specifically, given a zero-dimensional system $f_1=\\cdots=f_n=0$, with $f_i\\in\\mathbb{C}[x_1,\\ldots,x_n]$, and a polydisc $\\mathbf{\\Delta}\\subset\\mathbb{C}^n$, our method aims to certify the existence of $k$ solutions (counted with multiplicity) within the polydisc.\n  In case of success, it yields the correct result under guarantee. Otherwise, no information is given. However, we show that our algorithm always succeeds if $\\mathbf{\\Delta}$ is sufficiently small and well-i","authors_text":"Michael Sagraloff, Ruben Becker","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-12-15T00:33:30Z","title":"Counting Solutions of a Polynomial System Locally and Exactly"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05487","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:3e903c56a3130faef15149cc4d5c97425336bc9e26daaec3991189eb9325f12d","target":"record","created_at":"2026-05-18T00:27:56Z","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":"986a721b2bc04bb167634fe56102d7cd167bd89dc45d69502c1025287bfc6265","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-12-15T00:33:30Z","title_canon_sha256":"8ef68871fd25166da4eac7aa4ce5a6aa16ac27702e7420c50ce4f2d729ba9e03"},"schema_version":"1.0","source":{"id":"1712.05487","kind":"arxiv","version":1}},"canonical_sha256":"47b35817e7ad9573cfeedce674b5c8bc15ff348d847e3d2be96ed436142c027e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47b35817e7ad9573cfeedce674b5c8bc15ff348d847e3d2be96ed436142c027e","first_computed_at":"2026-05-18T00:27:56.295968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:56.295968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wb5oDju783E4pb4UAhdffa6Eq5o8Vev6vcRB0lNT4lmmzmkh2+PXTWb/RZNr9haYI1t9TVpyRnRIshiBqJ1sDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:56.296676Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05487","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e903c56a3130faef15149cc4d5c97425336bc9e26daaec3991189eb9325f12d","sha256:114f9abd7b0c345202788ac021d95e657c90553e39525e7fc4c56d728409aa50"],"state_sha256":"41cfd6708a49aa5d08ed48739d5bc13209aa61d39d4c36057cbd224414671e46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XDqIHB4O1tPdCG0ZX6L7qQmXTjciupgxeNNB0loW0HK4QWjlNudiQLaEiTAlNmZDJJYomzXgHmO2H9kqqt1tCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T19:59:06.331904Z","bundle_sha256":"5c1db6cd4ce31ba695cd424eefc34058ace5a715eea64eed9311679d2d1e5f1e"}}