{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EY4D7QGTAY6YPKWGVVJHNWP6SS","short_pith_number":"pith:EY4D7QGT","canonical_record":{"source":{"id":"1809.09402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-09-25T10:46:06Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"613641572d6783ee79cc389ed4550ad9afb851927fdb82376a8db0dc2a479ac9","abstract_canon_sha256":"2e62986eda3fbad800a75dd7ac56310c4d7b8193a98329e2792163bb6c5626ad"},"schema_version":"1.0"},"canonical_sha256":"26383fc0d3063d87aac6ad5276d9fe949a783ec29de1fa1a88636c12b0947d31","source":{"kind":"arxiv","id":"1809.09402","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09402","created_at":"2026-05-17T23:46:29Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09402v1","created_at":"2026-05-17T23:46:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09402","created_at":"2026-05-17T23:46:29Z"},{"alias_kind":"pith_short_12","alias_value":"EY4D7QGTAY6Y","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EY4D7QGTAY6YPKWG","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EY4D7QGT","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EY4D7QGTAY6YPKWGVVJHNWP6SS","target":"record","payload":{"canonical_record":{"source":{"id":"1809.09402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-09-25T10:46:06Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"613641572d6783ee79cc389ed4550ad9afb851927fdb82376a8db0dc2a479ac9","abstract_canon_sha256":"2e62986eda3fbad800a75dd7ac56310c4d7b8193a98329e2792163bb6c5626ad"},"schema_version":"1.0"},"canonical_sha256":"26383fc0d3063d87aac6ad5276d9fe949a783ec29de1fa1a88636c12b0947d31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:29.895448Z","signature_b64":"NkaMw7Imgu+1ZyVw7z5KewxgFCYHwDnfE/abVIJxrqbVYsc2r2TtzubHvpMrFkSPtkQRO1yhkxpwEzBCrEDTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26383fc0d3063d87aac6ad5276d9fe949a783ec29de1fa1a88636c12b0947d31","last_reissued_at":"2026-05-17T23:46:29.894695Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:29.894695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.09402","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-17T23:46:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lon/uefYLP+VgGCesyY27VCqG9wRtp1e9FvNy5PG91f95+pB5w4aPTJnTp4+TBxGMEZcZiplhZsv7NVI4G9tDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:24:09.471842Z"},"content_sha256":"9f0b06f5b7d266e78b61eab36ea0cef0c810af80573135c5884cd0c2f841aff4","schema_version":"1.0","event_id":"sha256:9f0b06f5b7d266e78b61eab36ea0cef0c810af80573135c5884cd0c2f841aff4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EY4D7QGTAY6YPKWGVVJHNWP6SS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cubics in 10 variables vs. cubics in 1000 variables: Uniformity phenomena for bounded degree polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.AC","authors_text":"Andrew Snowden, Daniel Erman, Steven V Sam","submitted_at":"2018-09-25T10:46:06Z","abstract_excerpt":"Hilbert famously showed that polynomials in n variables are not too complicated, in various senses. For example, the Hilbert Syzygy Theorem shows that the process of resolving a module by free modules terminates in finitely many (in fact, at most n) steps, while the Hilbert Basis Theorem shows that the process of finding generators for an ideal also terminates in finitely many steps. These results laid the foundations for the modern algebraic study of polynomials.\n  Hilbert's results are not uniform in n: unsurprisingly, polynomials in n variables will exhibit greater complexity as n increases"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09402","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-17T23:46:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kin76PYhiDbZzga6aVDZfnKnKmKD9+wfb683+QrY2IZQBRnK/DXSvyjmnf8CE9YQc8l9KJ8xxfd0IgAyFdqWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:24:09.472184Z"},"content_sha256":"745a2f760ff6cf3093f5686eff7a694a42933eba472cdf59102e7417fa654735","schema_version":"1.0","event_id":"sha256:745a2f760ff6cf3093f5686eff7a694a42933eba472cdf59102e7417fa654735"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EY4D7QGTAY6YPKWGVVJHNWP6SS/bundle.json","state_url":"https://pith.science/pith/EY4D7QGTAY6YPKWGVVJHNWP6SS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EY4D7QGTAY6YPKWGVVJHNWP6SS/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-07-05T09:24:09Z","links":{"resolver":"https://pith.science/pith/EY4D7QGTAY6YPKWGVVJHNWP6SS","bundle":"https://pith.science/pith/EY4D7QGTAY6YPKWGVVJHNWP6SS/bundle.json","state":"https://pith.science/pith/EY4D7QGTAY6YPKWGVVJHNWP6SS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EY4D7QGTAY6YPKWGVVJHNWP6SS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EY4D7QGTAY6YPKWGVVJHNWP6SS","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":"2e62986eda3fbad800a75dd7ac56310c4d7b8193a98329e2792163bb6c5626ad","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-09-25T10:46:06Z","title_canon_sha256":"613641572d6783ee79cc389ed4550ad9afb851927fdb82376a8db0dc2a479ac9"},"schema_version":"1.0","source":{"id":"1809.09402","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09402","created_at":"2026-05-17T23:46:29Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09402v1","created_at":"2026-05-17T23:46:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09402","created_at":"2026-05-17T23:46:29Z"},{"alias_kind":"pith_short_12","alias_value":"EY4D7QGTAY6Y","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EY4D7QGTAY6YPKWG","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EY4D7QGT","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:745a2f760ff6cf3093f5686eff7a694a42933eba472cdf59102e7417fa654735","target":"graph","created_at":"2026-05-17T23:46:29Z","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":"Hilbert famously showed that polynomials in n variables are not too complicated, in various senses. For example, the Hilbert Syzygy Theorem shows that the process of resolving a module by free modules terminates in finitely many (in fact, at most n) steps, while the Hilbert Basis Theorem shows that the process of finding generators for an ideal also terminates in finitely many steps. These results laid the foundations for the modern algebraic study of polynomials.\n  Hilbert's results are not uniform in n: unsurprisingly, polynomials in n variables will exhibit greater complexity as n increases","authors_text":"Andrew Snowden, Daniel Erman, Steven V Sam","cross_cats":["math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-09-25T10:46:06Z","title":"Cubics in 10 variables vs. cubics in 1000 variables: Uniformity phenomena for bounded degree polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09402","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:9f0b06f5b7d266e78b61eab36ea0cef0c810af80573135c5884cd0c2f841aff4","target":"record","created_at":"2026-05-17T23:46:29Z","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":"2e62986eda3fbad800a75dd7ac56310c4d7b8193a98329e2792163bb6c5626ad","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-09-25T10:46:06Z","title_canon_sha256":"613641572d6783ee79cc389ed4550ad9afb851927fdb82376a8db0dc2a479ac9"},"schema_version":"1.0","source":{"id":"1809.09402","kind":"arxiv","version":1}},"canonical_sha256":"26383fc0d3063d87aac6ad5276d9fe949a783ec29de1fa1a88636c12b0947d31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26383fc0d3063d87aac6ad5276d9fe949a783ec29de1fa1a88636c12b0947d31","first_computed_at":"2026-05-17T23:46:29.894695Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:29.894695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NkaMw7Imgu+1ZyVw7z5KewxgFCYHwDnfE/abVIJxrqbVYsc2r2TtzubHvpMrFkSPtkQRO1yhkxpwEzBCrEDTBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:29.895448Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.09402","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f0b06f5b7d266e78b61eab36ea0cef0c810af80573135c5884cd0c2f841aff4","sha256:745a2f760ff6cf3093f5686eff7a694a42933eba472cdf59102e7417fa654735"],"state_sha256":"4f96a601782345bff9abf77ce2957a887524810d7375422a34a866a0bb61ab30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jiUU5niA2TAQslsBPmkpst3kuRgHdgnKTyaVaBhTg9s9gG9BbS3vdMxa2OWMwY7ysg+nlO1Azb53PKB06MuCDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T09:24:09.474193Z","bundle_sha256":"bfcbc0497207eaf008e791e7383209a94e10b5e99c7d2b5a75314b97a9f57b92"}}