{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NV4WEVNNHR4VXEUX3K4N6JPGWB","short_pith_number":"pith:NV4WEVNN","canonical_record":{"source":{"id":"1709.01237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-05T04:55:47Z","cross_cats_sorted":["cs.LG","cs.NA"],"title_canon_sha256":"2493d62c91341ed3abf191cb5455612b3bda3e639abdd73d44fb6d0cce8184a9","abstract_canon_sha256":"499b7da882cdf37698e8c4434317da0cceb51420743d635d7297501b934e27b3"},"schema_version":"1.0"},"canonical_sha256":"6d796255ad3c795b9297dab8df25e6b067428ce54a7f03520afe77f892130d22","source":{"kind":"arxiv","id":"1709.01237","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01237","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01237v1","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01237","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"NV4WEVNNHR4V","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NV4WEVNNHR4VXEUX","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NV4WEVNN","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NV4WEVNNHR4VXEUX3K4N6JPGWB","target":"record","payload":{"canonical_record":{"source":{"id":"1709.01237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-05T04:55:47Z","cross_cats_sorted":["cs.LG","cs.NA"],"title_canon_sha256":"2493d62c91341ed3abf191cb5455612b3bda3e639abdd73d44fb6d0cce8184a9","abstract_canon_sha256":"499b7da882cdf37698e8c4434317da0cceb51420743d635d7297501b934e27b3"},"schema_version":"1.0"},"canonical_sha256":"6d796255ad3c795b9297dab8df25e6b067428ce54a7f03520afe77f892130d22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:00.600446Z","signature_b64":"xgWQxYJHAWueJ+NYVPyVq+FbJmTap47OENKmSps8JEixfWi5lNkqLbmlnp98zk7wxD//1/OKa2X0+QPXCvN1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d796255ad3c795b9297dab8df25e6b067428ce54a7f03520afe77f892130d22","last_reissued_at":"2026-05-18T00:36:00.600026Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:00.600026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.01237","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:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d8yPINwaNDEV2Nl0R+PAZFPaD+HdujThXrVoaPzBLINgvYzzNLi8kZGsm/XWoRzlsNrPAmAes7Fz9x9pyJUdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:40:57.228834Z"},"content_sha256":"7e00660c622087ca9526889d78a3adcb1e7d3670a73439162758db8b1a902e49","schema_version":"1.0","event_id":"sha256:7e00660c622087ca9526889d78a3adcb1e7d3670a73439162758db8b1a902e49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NV4WEVNNHR4VXEUX3K4N6JPGWB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Newton-type Methods for Inference in Higher-Order Markov Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA"],"primary_cat":"cs.CV","authors_text":"Hariprasad Kannan, Nikos Komodakis, Nikos Paragios","submitted_at":"2017-09-05T04:55:47Z","abstract_excerpt":"Linear programming relaxations are central to {\\sc map} inference in discrete Markov Random Fields. The ability to properly solve the Lagrangian dual is a critical component of such methods. In this paper, we study the benefit of using Newton-type methods to solve the Lagrangian dual of a smooth version of the problem. We investigate their ability to achieve superior convergence behavior and to better handle the ill-conditioned nature of the formulation, as compared to first order methods. We show that it is indeed possible to efficiently apply a trust region Newton method for a broad range of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01237","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:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HYr+MKaTOC/ihJvOmctbAyMHo/JgSGbtZ8Ntk4Eql0zqzf2J3kKhCu0KWdaQTeOlkl13TVffSArzpCTFmc7QAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:40:57.229171Z"},"content_sha256":"788d96af1be0ab76e784dd5cc165a7aaf94f45b82f511e2b5ca421a90a0f20dc","schema_version":"1.0","event_id":"sha256:788d96af1be0ab76e784dd5cc165a7aaf94f45b82f511e2b5ca421a90a0f20dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NV4WEVNNHR4VXEUX3K4N6JPGWB/bundle.json","state_url":"https://pith.science/pith/NV4WEVNNHR4VXEUX3K4N6JPGWB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NV4WEVNNHR4VXEUX3K4N6JPGWB/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-10T14:40:57Z","links":{"resolver":"https://pith.science/pith/NV4WEVNNHR4VXEUX3K4N6JPGWB","bundle":"https://pith.science/pith/NV4WEVNNHR4VXEUX3K4N6JPGWB/bundle.json","state":"https://pith.science/pith/NV4WEVNNHR4VXEUX3K4N6JPGWB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NV4WEVNNHR4VXEUX3K4N6JPGWB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NV4WEVNNHR4VXEUX3K4N6JPGWB","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":"499b7da882cdf37698e8c4434317da0cceb51420743d635d7297501b934e27b3","cross_cats_sorted":["cs.LG","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-05T04:55:47Z","title_canon_sha256":"2493d62c91341ed3abf191cb5455612b3bda3e639abdd73d44fb6d0cce8184a9"},"schema_version":"1.0","source":{"id":"1709.01237","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01237","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01237v1","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01237","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"NV4WEVNNHR4V","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NV4WEVNNHR4VXEUX","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NV4WEVNN","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:788d96af1be0ab76e784dd5cc165a7aaf94f45b82f511e2b5ca421a90a0f20dc","target":"graph","created_at":"2026-05-18T00:36:00Z","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":"Linear programming relaxations are central to {\\sc map} inference in discrete Markov Random Fields. The ability to properly solve the Lagrangian dual is a critical component of such methods. In this paper, we study the benefit of using Newton-type methods to solve the Lagrangian dual of a smooth version of the problem. We investigate their ability to achieve superior convergence behavior and to better handle the ill-conditioned nature of the formulation, as compared to first order methods. We show that it is indeed possible to efficiently apply a trust region Newton method for a broad range of","authors_text":"Hariprasad Kannan, Nikos Komodakis, Nikos Paragios","cross_cats":["cs.LG","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-05T04:55:47Z","title":"Newton-type Methods for Inference in Higher-Order Markov Random Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01237","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:7e00660c622087ca9526889d78a3adcb1e7d3670a73439162758db8b1a902e49","target":"record","created_at":"2026-05-18T00:36:00Z","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":"499b7da882cdf37698e8c4434317da0cceb51420743d635d7297501b934e27b3","cross_cats_sorted":["cs.LG","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-05T04:55:47Z","title_canon_sha256":"2493d62c91341ed3abf191cb5455612b3bda3e639abdd73d44fb6d0cce8184a9"},"schema_version":"1.0","source":{"id":"1709.01237","kind":"arxiv","version":1}},"canonical_sha256":"6d796255ad3c795b9297dab8df25e6b067428ce54a7f03520afe77f892130d22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d796255ad3c795b9297dab8df25e6b067428ce54a7f03520afe77f892130d22","first_computed_at":"2026-05-18T00:36:00.600026Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:00.600026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xgWQxYJHAWueJ+NYVPyVq+FbJmTap47OENKmSps8JEixfWi5lNkqLbmlnp98zk7wxD//1/OKa2X0+QPXCvN1BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:00.600446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01237","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e00660c622087ca9526889d78a3adcb1e7d3670a73439162758db8b1a902e49","sha256:788d96af1be0ab76e784dd5cc165a7aaf94f45b82f511e2b5ca421a90a0f20dc"],"state_sha256":"df10a24b8dab14bcc05bad027e9d430279afad71b59832200acb5b1baf442bf3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gUI8VWiFMys3gizi8m/en+l33J82s2hdZy0J5PSB8JwL/W3GMnwGLgPN348Hn3PmqxsAySP7/GzyxRmopjwcAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T14:40:57.231387Z","bundle_sha256":"e8e03eff3ae8f34955e52f446bcb434bfa38c92e842fe3309d524c3ac887abe9"}}