{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JOYOJRNYAMVIGN5M7S7SLABEX3","short_pith_number":"pith:JOYOJRNY","canonical_record":{"source":{"id":"1902.00208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-02-01T07:42:59Z","cross_cats_sorted":[],"title_canon_sha256":"b4481285f0e4ad648e638d78f72d0c6b2fdcdf9f45544784c684cd3ac6ac2c34","abstract_canon_sha256":"4c7a93d92c44cb863c3e645321e55e7568f7dbc8e970cf2a82938abee170efb7"},"schema_version":"1.0"},"canonical_sha256":"4bb0e4c5b8032a8337acfcbf258024beed31a6ffb76566658fcaec64f86d6c39","source":{"kind":"arxiv","id":"1902.00208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00208","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00208v1","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00208","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"JOYOJRNYAMVI","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JOYOJRNYAMVIGN5M","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JOYOJRNY","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JOYOJRNYAMVIGN5M7S7SLABEX3","target":"record","payload":{"canonical_record":{"source":{"id":"1902.00208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-02-01T07:42:59Z","cross_cats_sorted":[],"title_canon_sha256":"b4481285f0e4ad648e638d78f72d0c6b2fdcdf9f45544784c684cd3ac6ac2c34","abstract_canon_sha256":"4c7a93d92c44cb863c3e645321e55e7568f7dbc8e970cf2a82938abee170efb7"},"schema_version":"1.0"},"canonical_sha256":"4bb0e4c5b8032a8337acfcbf258024beed31a6ffb76566658fcaec64f86d6c39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:58.041106Z","signature_b64":"CssJKwp0W9wJaOiTmwQbOEWiSFw8CP1/LGOoAx8bNFhbdO4sQu8MkNMjDLAbYZ78ZGAI+syiXSY0GPppKSj3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bb0e4c5b8032a8337acfcbf258024beed31a6ffb76566658fcaec64f86d6c39","last_reissued_at":"2026-05-17T23:54:58.040686Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:58.040686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.00208","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:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AyfiIH9iaP2YtCNobapy3EsDfIvADnri7BFcgdc0CZ42dxmE49SfZ8WkOrYHv4seLh+kcMBGzJvkex1GbeGkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T10:36:51.268459Z"},"content_sha256":"890636ac775a5410b352f0e9941f8bb1dc52ee8e865868cce85b172a1aa8986e","schema_version":"1.0","event_id":"sha256:890636ac775a5410b352f0e9941f8bb1dc52ee8e865868cce85b172a1aa8986e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JOYOJRNYAMVIGN5M7S7SLABEX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gr{\\\"o}bner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Elias Tsigaridas (PolSys), Jean-Charles Faug\\`ere (PolSys), Mat\\'ias Bender (PolSys)","submitted_at":"2019-02-01T07:42:59Z","abstract_excerpt":"Gr{\\\"o}bner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables. However, in most of the cases, the polynomial systems coming from applications have some kind of structure. For example , several problems in computer-aided design, robotics, vision, biology , kinematics, cryptography, and optimization involve sparse systems where the input polynomials have a few non-zero terms. Our approach to exploit sparsity is to embed the systems in a semigroup algeb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00208","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:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3lQ+v02iWldxKQ/4TIu/ns7j9kdm01UQwZgvIuwU3KNQaOCZFaD9o162Eflw5XAI5+qY5YLAK8YSqQEVOxgTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T10:36:51.268906Z"},"content_sha256":"060a6189c194650a4c431530fbd7843aa2bc200c5826356953c5bf36247f9f45","schema_version":"1.0","event_id":"sha256:060a6189c194650a4c431530fbd7843aa2bc200c5826356953c5bf36247f9f45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JOYOJRNYAMVIGN5M7S7SLABEX3/bundle.json","state_url":"https://pith.science/pith/JOYOJRNYAMVIGN5M7S7SLABEX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JOYOJRNYAMVIGN5M7S7SLABEX3/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-06T10:36:51Z","links":{"resolver":"https://pith.science/pith/JOYOJRNYAMVIGN5M7S7SLABEX3","bundle":"https://pith.science/pith/JOYOJRNYAMVIGN5M7S7SLABEX3/bundle.json","state":"https://pith.science/pith/JOYOJRNYAMVIGN5M7S7SLABEX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JOYOJRNYAMVIGN5M7S7SLABEX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JOYOJRNYAMVIGN5M7S7SLABEX3","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":"4c7a93d92c44cb863c3e645321e55e7568f7dbc8e970cf2a82938abee170efb7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-02-01T07:42:59Z","title_canon_sha256":"b4481285f0e4ad648e638d78f72d0c6b2fdcdf9f45544784c684cd3ac6ac2c34"},"schema_version":"1.0","source":{"id":"1902.00208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00208","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00208v1","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00208","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"JOYOJRNYAMVI","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JOYOJRNYAMVIGN5M","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JOYOJRNY","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:060a6189c194650a4c431530fbd7843aa2bc200c5826356953c5bf36247f9f45","target":"graph","created_at":"2026-05-17T23:54:58Z","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":"Gr{\\\"o}bner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables. However, in most of the cases, the polynomial systems coming from applications have some kind of structure. For example , several problems in computer-aided design, robotics, vision, biology , kinematics, cryptography, and optimization involve sparse systems where the input polynomials have a few non-zero terms. Our approach to exploit sparsity is to embed the systems in a semigroup algeb","authors_text":"Elias Tsigaridas (PolSys), Jean-Charles Faug\\`ere (PolSys), Mat\\'ias Bender (PolSys)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-02-01T07:42:59Z","title":"Gr{\\\"o}bner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00208","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:890636ac775a5410b352f0e9941f8bb1dc52ee8e865868cce85b172a1aa8986e","target":"record","created_at":"2026-05-17T23:54:58Z","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":"4c7a93d92c44cb863c3e645321e55e7568f7dbc8e970cf2a82938abee170efb7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-02-01T07:42:59Z","title_canon_sha256":"b4481285f0e4ad648e638d78f72d0c6b2fdcdf9f45544784c684cd3ac6ac2c34"},"schema_version":"1.0","source":{"id":"1902.00208","kind":"arxiv","version":1}},"canonical_sha256":"4bb0e4c5b8032a8337acfcbf258024beed31a6ffb76566658fcaec64f86d6c39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bb0e4c5b8032a8337acfcbf258024beed31a6ffb76566658fcaec64f86d6c39","first_computed_at":"2026-05-17T23:54:58.040686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:58.040686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CssJKwp0W9wJaOiTmwQbOEWiSFw8CP1/LGOoAx8bNFhbdO4sQu8MkNMjDLAbYZ78ZGAI+syiXSY0GPppKSj3Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:58.041106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:890636ac775a5410b352f0e9941f8bb1dc52ee8e865868cce85b172a1aa8986e","sha256:060a6189c194650a4c431530fbd7843aa2bc200c5826356953c5bf36247f9f45"],"state_sha256":"df4fbde47bc6939fc57f4ea8d9a3a4ca50d37a07d001ed5ad523ec44b0b86b46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0k5CiTJwzLpgaAS5j38E19IK+wykx5t9X8ziT4nqHfZJwdddzcC4Uzaw2aARFUDmJtE/C8MrEyglVvj/PkZZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T10:36:51.271815Z","bundle_sha256":"69a65df2d5427a06de61edcb9a182c9a3ebcc67c2580cd55b5d6f2912b987624"}}