{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZIITGAPPVCHXU4LX6DT73WH5PW","short_pith_number":"pith:ZIITGAPP","canonical_record":{"source":{"id":"1807.08289","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.SC","submitted_at":"2018-07-22T14:40:34Z","cross_cats_sorted":[],"title_canon_sha256":"3e85b727393e641383a40e4e267496b8237bc69846c269e244fd9b7ec4b733ec","abstract_canon_sha256":"228c4e36366bb95f8355603e0f9002bee7419286073fa0d9690137e1c66d2fca"},"schema_version":"1.0"},"canonical_sha256":"ca113301efa88f7a7177f0e7fdd8fd7d837419f99a0f2780029b27596ff2b92d","source":{"kind":"arxiv","id":"1807.08289","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08289","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08289v1","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08289","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"pith_short_12","alias_value":"ZIITGAPPVCHX","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZIITGAPPVCHXU4LX","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZIITGAPP","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZIITGAPPVCHXU4LX6DT73WH5PW","target":"record","payload":{"canonical_record":{"source":{"id":"1807.08289","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.SC","submitted_at":"2018-07-22T14:40:34Z","cross_cats_sorted":[],"title_canon_sha256":"3e85b727393e641383a40e4e267496b8237bc69846c269e244fd9b7ec4b733ec","abstract_canon_sha256":"228c4e36366bb95f8355603e0f9002bee7419286073fa0d9690137e1c66d2fca"},"schema_version":"1.0"},"canonical_sha256":"ca113301efa88f7a7177f0e7fdd8fd7d837419f99a0f2780029b27596ff2b92d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:08.570000Z","signature_b64":"W8BsggygP7IDx7/k2PTS98gFdh2j6QeIZu2kF4FEe1RfJGOD7UF1YB/gThb5LIhlSpjwCv7R5poutWbXSHhbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca113301efa88f7a7177f0e7fdd8fd7d837419f99a0f2780029b27596ff2b92d","last_reissued_at":"2026-05-18T00:10:08.569196Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:08.569196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.08289","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:10:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i/0piNfLMvWjGb1qPL/LSIt/ugfs8dc4kStdPuQN/j9YLHZNbkXMig+tHVZn9Tvc8gd3D7zcb8eh8b+DXk04Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:14:45.292308Z"},"content_sha256":"23cfe4354caf061980db9a2e1f85a96805d7e2b71dd64069980d039a3c554c25","schema_version":"1.0","event_id":"sha256:23cfe4354caf061980db9a2e1f85a96805d7e2b71dd64069980d039a3c554c25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZIITGAPPVCHXU4LX6DT73WH5PW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"What Can (and Can't) we Do with Sparse Polynomials?","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Daniel S. Roche","submitted_at":"2018-07-22T14:40:34Z","abstract_excerpt":"Simply put, a sparse polynomial is one whose zero coefficients are not explicitly stored. Such objects are ubiquitous in exact computing, and so naturally we would like to have efficient algorithms to handle them. However, with this compact storage comes new algorithmic challenges, as fast algorithms for dense polynomials may no longer be efficient. In this tutorial we examine the state of the art for sparse polynomial algorithms in three areas: arithmetic, interpolation, and factorization. The aim is to highlight recent progress both in theory and in practice, as well as opportunities for fut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08289","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:10:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6UxBnNYjOYQIufvko3FgF6O5a+wi2vbdaoEJEvyoxxPDfWd66BAWJiKGE4BtEYGihtMixkGJnhleCJrUK7hzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:14:45.292659Z"},"content_sha256":"187bb8ba2c94dffa37d46a8c44034cb8fb34763386463f3733a25bb183a66a18","schema_version":"1.0","event_id":"sha256:187bb8ba2c94dffa37d46a8c44034cb8fb34763386463f3733a25bb183a66a18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZIITGAPPVCHXU4LX6DT73WH5PW/bundle.json","state_url":"https://pith.science/pith/ZIITGAPPVCHXU4LX6DT73WH5PW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZIITGAPPVCHXU4LX6DT73WH5PW/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-27T15:14:45Z","links":{"resolver":"https://pith.science/pith/ZIITGAPPVCHXU4LX6DT73WH5PW","bundle":"https://pith.science/pith/ZIITGAPPVCHXU4LX6DT73WH5PW/bundle.json","state":"https://pith.science/pith/ZIITGAPPVCHXU4LX6DT73WH5PW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZIITGAPPVCHXU4LX6DT73WH5PW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZIITGAPPVCHXU4LX6DT73WH5PW","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":"228c4e36366bb95f8355603e0f9002bee7419286073fa0d9690137e1c66d2fca","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.SC","submitted_at":"2018-07-22T14:40:34Z","title_canon_sha256":"3e85b727393e641383a40e4e267496b8237bc69846c269e244fd9b7ec4b733ec"},"schema_version":"1.0","source":{"id":"1807.08289","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08289","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08289v1","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08289","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"pith_short_12","alias_value":"ZIITGAPPVCHX","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZIITGAPPVCHXU4LX","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZIITGAPP","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:187bb8ba2c94dffa37d46a8c44034cb8fb34763386463f3733a25bb183a66a18","target":"graph","created_at":"2026-05-18T00:10:08Z","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":"Simply put, a sparse polynomial is one whose zero coefficients are not explicitly stored. Such objects are ubiquitous in exact computing, and so naturally we would like to have efficient algorithms to handle them. However, with this compact storage comes new algorithmic challenges, as fast algorithms for dense polynomials may no longer be efficient. In this tutorial we examine the state of the art for sparse polynomial algorithms in three areas: arithmetic, interpolation, and factorization. The aim is to highlight recent progress both in theory and in practice, as well as opportunities for fut","authors_text":"Daniel S. Roche","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.SC","submitted_at":"2018-07-22T14:40:34Z","title":"What Can (and Can't) we Do with Sparse Polynomials?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08289","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:23cfe4354caf061980db9a2e1f85a96805d7e2b71dd64069980d039a3c554c25","target":"record","created_at":"2026-05-18T00:10:08Z","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":"228c4e36366bb95f8355603e0f9002bee7419286073fa0d9690137e1c66d2fca","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.SC","submitted_at":"2018-07-22T14:40:34Z","title_canon_sha256":"3e85b727393e641383a40e4e267496b8237bc69846c269e244fd9b7ec4b733ec"},"schema_version":"1.0","source":{"id":"1807.08289","kind":"arxiv","version":1}},"canonical_sha256":"ca113301efa88f7a7177f0e7fdd8fd7d837419f99a0f2780029b27596ff2b92d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca113301efa88f7a7177f0e7fdd8fd7d837419f99a0f2780029b27596ff2b92d","first_computed_at":"2026-05-18T00:10:08.569196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:08.569196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W8BsggygP7IDx7/k2PTS98gFdh2j6QeIZu2kF4FEe1RfJGOD7UF1YB/gThb5LIhlSpjwCv7R5poutWbXSHhbDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:08.570000Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.08289","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23cfe4354caf061980db9a2e1f85a96805d7e2b71dd64069980d039a3c554c25","sha256:187bb8ba2c94dffa37d46a8c44034cb8fb34763386463f3733a25bb183a66a18"],"state_sha256":"f2880cdb9acdadc23ed1c34c4bc7926eb4eee7842cf9c8cf57ec5afcab9bd92b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8DF7tx7tXirzOeWElubNqHypZI2KknWW9WNMIJCsdECxDwEbBYId6v4bSTKJ447MY8lZrOqxC2FQKwZPFCc6Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T15:14:45.294730Z","bundle_sha256":"b6a41b1a4904bfd1d88941bc9cc5ee154d0dba368e9ab6fe6d35ad4e5147b355"}}