{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7B7A75IZNT56HK6PHUFS7DWAMW","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":"4dfef954e9943ef4ddfab1879c82daae1ec9cdd2cdc76f17d22f3d3345797bf8","cross_cats_sorted":["cs.DM","math.CO","quant-ph"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-29T20:22:12Z","title_canon_sha256":"3a706fa1e622301ad587d9b691e6b847c07665ff32909b9c86bb340a496a0e2d"},"schema_version":"1.0","source":{"id":"1504.08011","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08011","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08011v2","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08011","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"pith_short_12","alias_value":"7B7A75IZNT56","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"7B7A75IZNT56HK6P","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"7B7A75IZ","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:ec502fce2dfc6eea04819c6c9afc14830bae9d8a51c13c629bde3622668e396b","target":"graph","created_at":"2026-05-18T01:24:10Z","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":"In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many combinatorial problems are NP-hard and the computational complexity makes this research approach difficult using a standard brute force approach on a typical computer. One sample problem explored is that of finding a minimum identifying code. To work around the computational issues, a variety of methods are explored and consist of a parallel computing approach using Matlab, a quantum annealing approach using the D-Wave computer, and lastly using satisfiability modulo theor","authors_text":"Stanley Bak, Steve Adachi, Victoria Horan","cross_cats":["cs.DM","math.CO","quant-ph"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-29T20:22:12Z","title":"A Comparison of Approaches for Solving Hard Graph-Theoretic Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08011","kind":"arxiv","version":2},"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:7b8749fd848fa26e2e4e4249bcb9a7e56c9679c340b68b43261ceb7a1607fff5","target":"record","created_at":"2026-05-18T01:24:10Z","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":"4dfef954e9943ef4ddfab1879c82daae1ec9cdd2cdc76f17d22f3d3345797bf8","cross_cats_sorted":["cs.DM","math.CO","quant-ph"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-29T20:22:12Z","title_canon_sha256":"3a706fa1e622301ad587d9b691e6b847c07665ff32909b9c86bb340a496a0e2d"},"schema_version":"1.0","source":{"id":"1504.08011","kind":"arxiv","version":2}},"canonical_sha256":"f87e0ff5196cfbe3abcf3d0b2f8ec06583dd24620889b4730e66ceed2a2446ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f87e0ff5196cfbe3abcf3d0b2f8ec06583dd24620889b4730e66ceed2a2446ff","first_computed_at":"2026-05-18T01:24:10.862714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:10.862714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j2zciF1DVNYF8L1GSABV4so4F4JvN/b+67DTiuGANiypdxgU6AGiAFF6qblM3xFxK9DIEmaitAcvciXP8MLHDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:10.863291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.08011","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b8749fd848fa26e2e4e4249bcb9a7e56c9679c340b68b43261ceb7a1607fff5","sha256:ec502fce2dfc6eea04819c6c9afc14830bae9d8a51c13c629bde3622668e396b"],"state_sha256":"e15007128b2a2a5b599405b9c8390c77c124505fc763e50c86255f138d80c844"}