{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4TWTR7M4QSVV2D2BGN6RESFBKD","short_pith_number":"pith:4TWTR7M4","canonical_record":{"source":{"id":"1703.02689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-08T03:55:27Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"1715f6f71309e0442560b590d98de286ed7579c776e2e9495569ef5f92cfc989","abstract_canon_sha256":"36316de393f1bd956a061ecbdf91d250d8d83b44fc9b234a5624d5bacb324fd9"},"schema_version":"1.0"},"canonical_sha256":"e4ed38fd9c84ab5d0f41337d1248a150dc018c50e1e236b65dad641e267082c4","source":{"kind":"arxiv","id":"1703.02689","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02689","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02689v1","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02689","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"pith_short_12","alias_value":"4TWTR7M4QSVV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4TWTR7M4QSVV2D2B","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4TWTR7M4","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4TWTR7M4QSVV2D2BGN6RESFBKD","target":"record","payload":{"canonical_record":{"source":{"id":"1703.02689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-08T03:55:27Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"1715f6f71309e0442560b590d98de286ed7579c776e2e9495569ef5f92cfc989","abstract_canon_sha256":"36316de393f1bd956a061ecbdf91d250d8d83b44fc9b234a5624d5bacb324fd9"},"schema_version":"1.0"},"canonical_sha256":"e4ed38fd9c84ab5d0f41337d1248a150dc018c50e1e236b65dad641e267082c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:05.865570Z","signature_b64":"3hmwFo0QuU4MKw7+bVFsv5NV5BSxVyGW4W0kGyYQy9bK8giLQm5w8mPl3ZZK+QPXglwhheyIdJTtsU+2lN8ZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4ed38fd9c84ab5d0f41337d1248a150dc018c50e1e236b65dad641e267082c4","last_reissued_at":"2026-05-18T00:49:05.865136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:05.865136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.02689","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:49:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Qs4rBsKtlwE7dmK5CDKKBlFEAWdXq57DfokveW6Ofdpwqm+IruCMGlmB7mo7y6+iDsdaWWupuBBv4sNemBaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:19:05.614186Z"},"content_sha256":"4fd2836c900e2472ae24e9de76de2ee4928d3ed712549ad61c554f9480cf861f","schema_version":"1.0","event_id":"sha256:4fd2836c900e2472ae24e9de76de2ee4928d3ed712549ad61c554f9480cf861f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4TWTR7M4QSVV2D2BGN6RESFBKD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact MAP Inference by Avoiding Fractional Vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Adam Klivans, Alexandros G. Dimakis, Erik M. Lindgren","submitted_at":"2017-03-08T03:55:27Z","abstract_excerpt":"Given a graphical model, one essential problem is MAP inference, that is, finding the most likely configuration of states according to the model. Although this problem is NP-hard, large instances can be solved in practice. A major open question is to explain why this is true. We give a natural condition under which we can provably perform MAP inference in polynomial time. We require that the number of fractional vertices in the LP relaxation exceeding the optimal solution is bounded by a polynomial in the problem size. This resolves an open question by Dimakis, Gohari, and Wainwright. In contr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02689","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:49:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E1bFi8fK10Q+e7N36uKkXdtuIuQiCQWJDuES/rFmfANgoJgb5kWlGbRz4wzjwKLRpU+Dl8O1s6iFRtj57456Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:19:05.614881Z"},"content_sha256":"0f6e258335cbcca566e7798e1d7fc2d4d9841c7ae26bb045c36d8f1231da4643","schema_version":"1.0","event_id":"sha256:0f6e258335cbcca566e7798e1d7fc2d4d9841c7ae26bb045c36d8f1231da4643"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TWTR7M4QSVV2D2BGN6RESFBKD/bundle.json","state_url":"https://pith.science/pith/4TWTR7M4QSVV2D2BGN6RESFBKD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TWTR7M4QSVV2D2BGN6RESFBKD/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-05-28T23:19:05Z","links":{"resolver":"https://pith.science/pith/4TWTR7M4QSVV2D2BGN6RESFBKD","bundle":"https://pith.science/pith/4TWTR7M4QSVV2D2BGN6RESFBKD/bundle.json","state":"https://pith.science/pith/4TWTR7M4QSVV2D2BGN6RESFBKD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TWTR7M4QSVV2D2BGN6RESFBKD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4TWTR7M4QSVV2D2BGN6RESFBKD","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":"36316de393f1bd956a061ecbdf91d250d8d83b44fc9b234a5624d5bacb324fd9","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-08T03:55:27Z","title_canon_sha256":"1715f6f71309e0442560b590d98de286ed7579c776e2e9495569ef5f92cfc989"},"schema_version":"1.0","source":{"id":"1703.02689","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02689","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02689v1","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02689","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"pith_short_12","alias_value":"4TWTR7M4QSVV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4TWTR7M4QSVV2D2B","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4TWTR7M4","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:0f6e258335cbcca566e7798e1d7fc2d4d9841c7ae26bb045c36d8f1231da4643","target":"graph","created_at":"2026-05-18T00:49:05Z","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":"Given a graphical model, one essential problem is MAP inference, that is, finding the most likely configuration of states according to the model. Although this problem is NP-hard, large instances can be solved in practice. A major open question is to explain why this is true. We give a natural condition under which we can provably perform MAP inference in polynomial time. We require that the number of fractional vertices in the LP relaxation exceeding the optimal solution is bounded by a polynomial in the problem size. This resolves an open question by Dimakis, Gohari, and Wainwright. In contr","authors_text":"Adam Klivans, Alexandros G. Dimakis, Erik M. Lindgren","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-08T03:55:27Z","title":"Exact MAP Inference by Avoiding Fractional Vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02689","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:4fd2836c900e2472ae24e9de76de2ee4928d3ed712549ad61c554f9480cf861f","target":"record","created_at":"2026-05-18T00:49:05Z","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":"36316de393f1bd956a061ecbdf91d250d8d83b44fc9b234a5624d5bacb324fd9","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-08T03:55:27Z","title_canon_sha256":"1715f6f71309e0442560b590d98de286ed7579c776e2e9495569ef5f92cfc989"},"schema_version":"1.0","source":{"id":"1703.02689","kind":"arxiv","version":1}},"canonical_sha256":"e4ed38fd9c84ab5d0f41337d1248a150dc018c50e1e236b65dad641e267082c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4ed38fd9c84ab5d0f41337d1248a150dc018c50e1e236b65dad641e267082c4","first_computed_at":"2026-05-18T00:49:05.865136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:05.865136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3hmwFo0QuU4MKw7+bVFsv5NV5BSxVyGW4W0kGyYQy9bK8giLQm5w8mPl3ZZK+QPXglwhheyIdJTtsU+2lN8ZDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:05.865570Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02689","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fd2836c900e2472ae24e9de76de2ee4928d3ed712549ad61c554f9480cf861f","sha256:0f6e258335cbcca566e7798e1d7fc2d4d9841c7ae26bb045c36d8f1231da4643"],"state_sha256":"2630a62834018f8eb0845586cb41f7e79f5381854cfa56e08e42eb4c1d798dac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MiwuhyY4ck2CqTDfJDpyAh96Lp+HrKWxnCbqEWB3Gh00HEcRZfW+20aUbUBmTpwFuqRbIJAXrPXOEHbV9iTOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:19:05.618585Z","bundle_sha256":"93dcca77d2c6f10be44a7de3ecb5ab12e487a04144eeb84b4321a5328628dd67"}}