{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:P7B7ANIRYKDXYZ4OG6MW55VPBJ","short_pith_number":"pith:P7B7ANIR","canonical_record":{"source":{"id":"1902.04215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-12T02:08:43Z","cross_cats_sorted":["cs.DM","cs.ET","math.CO","math.OC"],"title_canon_sha256":"70e37b9844bc6534cf0a985bbc5d954fa83745fc9726ae9eb829b64ee1d03079","abstract_canon_sha256":"d7e2e663d800a19f63ef43fc1227288d4ea452ce540f6858b3c30f409595b4d0"},"schema_version":"1.0"},"canonical_sha256":"7fc3f03511c2877c678e37996ef6af0a68760c4148ac5679a2b5919f88fa24c5","source":{"kind":"arxiv","id":"1902.04215","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04215","created_at":"2026-05-17T23:54:12Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04215v1","created_at":"2026-05-17T23:54:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04215","created_at":"2026-05-17T23:54:12Z"},{"alias_kind":"pith_short_12","alias_value":"P7B7ANIRYKDX","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"P7B7ANIRYKDXYZ4O","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"P7B7ANIR","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:P7B7ANIRYKDXYZ4OG6MW55VPBJ","target":"record","payload":{"canonical_record":{"source":{"id":"1902.04215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-12T02:08:43Z","cross_cats_sorted":["cs.DM","cs.ET","math.CO","math.OC"],"title_canon_sha256":"70e37b9844bc6534cf0a985bbc5d954fa83745fc9726ae9eb829b64ee1d03079","abstract_canon_sha256":"d7e2e663d800a19f63ef43fc1227288d4ea452ce540f6858b3c30f409595b4d0"},"schema_version":"1.0"},"canonical_sha256":"7fc3f03511c2877c678e37996ef6af0a68760c4148ac5679a2b5919f88fa24c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:12.818612Z","signature_b64":"U0yfjCZzWOmjDGNp3sSUMNjY/gvbLEDAavPsdThwvBfdUSYh6AWs+IE5uGlG3jLRrbFqGWN+zf/vdHnTl1nsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fc3f03511c2877c678e37996ef6af0a68760c4148ac5679a2b5919f88fa24c5","last_reissued_at":"2026-05-17T23:54:12.818145Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:12.818145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.04215","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:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WvcP5InAbk4melXz4K8vod9rBAxv1Ls33qLPCWcnBGtdETdY+Mjum/a3Lv7p9Xd+vuBh8mg995UW0PR52/tyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:15:03.919389Z"},"content_sha256":"28c9402e0b1b209eb1ea65b5ee5d7c13dd5b0482b71c241d6e6e98f253d6b249","schema_version":"1.0","event_id":"sha256:28c9402e0b1b209eb1ea65b5ee5d7c13dd5b0482b71c241d6e6e98f253d6b249"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:P7B7ANIRYKDXYZ4OG6MW55VPBJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graver Bases via Quantum Annealing with Application to Non-Linear Integer Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.ET","math.CO","math.OC"],"primary_cat":"quant-ph","authors_text":"Hedayat Alghassi, Raouf Dridi, Sridhar Tayur","submitted_at":"2019-02-12T02:08:43Z","abstract_excerpt":"We propose a novel hybrid quantum-classical approach to calculate Graver bases, which have the potential to solve a variety of hard linear and non-linear integer programs, as they form a test set (optimality certificate) with very appealing properties. The calculation of Graver bases is exponentially hard (in general) on classical computers, so they not used for solving practical problems on commercial solvers. With a quantum annealer, however, it may be a viable approach to use them. We test two hybrid quantum-classical algorithms (on D-Wave)--one for computing Graver basis and a second for o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04215","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:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1dC+o3nRdnFwUzvu8Oqj4aj3vAOCc5bw3oIEQDiNhp6hBuoiYXVphDJhZmNryBTVDgU/eBmMfNdQVqClVUd0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:15:03.919739Z"},"content_sha256":"dad0566266d96ed0dfa7e93a70c755b9bec1a592ea7d558b7fe7f39a95ddcf1e","schema_version":"1.0","event_id":"sha256:dad0566266d96ed0dfa7e93a70c755b9bec1a592ea7d558b7fe7f39a95ddcf1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P7B7ANIRYKDXYZ4OG6MW55VPBJ/bundle.json","state_url":"https://pith.science/pith/P7B7ANIRYKDXYZ4OG6MW55VPBJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P7B7ANIRYKDXYZ4OG6MW55VPBJ/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-01T17:15:03Z","links":{"resolver":"https://pith.science/pith/P7B7ANIRYKDXYZ4OG6MW55VPBJ","bundle":"https://pith.science/pith/P7B7ANIRYKDXYZ4OG6MW55VPBJ/bundle.json","state":"https://pith.science/pith/P7B7ANIRYKDXYZ4OG6MW55VPBJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P7B7ANIRYKDXYZ4OG6MW55VPBJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:P7B7ANIRYKDXYZ4OG6MW55VPBJ","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":"d7e2e663d800a19f63ef43fc1227288d4ea452ce540f6858b3c30f409595b4d0","cross_cats_sorted":["cs.DM","cs.ET","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-12T02:08:43Z","title_canon_sha256":"70e37b9844bc6534cf0a985bbc5d954fa83745fc9726ae9eb829b64ee1d03079"},"schema_version":"1.0","source":{"id":"1902.04215","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04215","created_at":"2026-05-17T23:54:12Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04215v1","created_at":"2026-05-17T23:54:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04215","created_at":"2026-05-17T23:54:12Z"},{"alias_kind":"pith_short_12","alias_value":"P7B7ANIRYKDX","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"P7B7ANIRYKDXYZ4O","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"P7B7ANIR","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:dad0566266d96ed0dfa7e93a70c755b9bec1a592ea7d558b7fe7f39a95ddcf1e","target":"graph","created_at":"2026-05-17T23:54: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":"We propose a novel hybrid quantum-classical approach to calculate Graver bases, which have the potential to solve a variety of hard linear and non-linear integer programs, as they form a test set (optimality certificate) with very appealing properties. The calculation of Graver bases is exponentially hard (in general) on classical computers, so they not used for solving practical problems on commercial solvers. With a quantum annealer, however, it may be a viable approach to use them. We test two hybrid quantum-classical algorithms (on D-Wave)--one for computing Graver basis and a second for o","authors_text":"Hedayat Alghassi, Raouf Dridi, Sridhar Tayur","cross_cats":["cs.DM","cs.ET","math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-12T02:08:43Z","title":"Graver Bases via Quantum Annealing with Application to Non-Linear Integer Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04215","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:28c9402e0b1b209eb1ea65b5ee5d7c13dd5b0482b71c241d6e6e98f253d6b249","target":"record","created_at":"2026-05-17T23:54: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":"d7e2e663d800a19f63ef43fc1227288d4ea452ce540f6858b3c30f409595b4d0","cross_cats_sorted":["cs.DM","cs.ET","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-12T02:08:43Z","title_canon_sha256":"70e37b9844bc6534cf0a985bbc5d954fa83745fc9726ae9eb829b64ee1d03079"},"schema_version":"1.0","source":{"id":"1902.04215","kind":"arxiv","version":1}},"canonical_sha256":"7fc3f03511c2877c678e37996ef6af0a68760c4148ac5679a2b5919f88fa24c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fc3f03511c2877c678e37996ef6af0a68760c4148ac5679a2b5919f88fa24c5","first_computed_at":"2026-05-17T23:54:12.818145Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:12.818145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U0yfjCZzWOmjDGNp3sSUMNjY/gvbLEDAavPsdThwvBfdUSYh6AWs+IE5uGlG3jLRrbFqGWN+zf/vdHnTl1nsBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:12.818612Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.04215","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28c9402e0b1b209eb1ea65b5ee5d7c13dd5b0482b71c241d6e6e98f253d6b249","sha256:dad0566266d96ed0dfa7e93a70c755b9bec1a592ea7d558b7fe7f39a95ddcf1e"],"state_sha256":"8f4a24362a1291d608861446415b9ccad37445fd9786facb4a47db1b0cdb485c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7G8b5R68rBG8jZc2qYXEgN2uYUbPmszfJcVes88qGJwbEX7Ydu5U8Lgj9nnVXbGDBeHVfm94HMarpgLDdvpDBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:15:03.921690Z","bundle_sha256":"19dac725b250c6f2881e5724c09556690661253fcb0467c87b6b6db446c6cc42"}}