{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TXMTLDSCIF3N6GZXQQZELHYP4I","short_pith_number":"pith:TXMTLDSC","canonical_record":{"source":{"id":"1109.2304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-11T10:58:44Z","cross_cats_sorted":["cs.CV","cs.DM"],"title_canon_sha256":"91c9c1304a30c3659857c090020aac1c141960ca3b52efa1b5eedf8d1011b5c0","abstract_canon_sha256":"ef9bd1765028c56cef649334892e46b57839ad4a2340e2e0bced8bd5bf0c9754"},"schema_version":"1.0"},"canonical_sha256":"9dd9358e424176df1b378432459f0fe21b5a3fb5364d9b102badd9fb1fc653f7","source":{"kind":"arxiv","id":"1109.2304","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2304","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2304v2","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2304","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"TXMTLDSCIF3N","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TXMTLDSCIF3N6GZX","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TXMTLDSC","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TXMTLDSCIF3N6GZXQQZELHYP4I","target":"record","payload":{"canonical_record":{"source":{"id":"1109.2304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-11T10:58:44Z","cross_cats_sorted":["cs.CV","cs.DM"],"title_canon_sha256":"91c9c1304a30c3659857c090020aac1c141960ca3b52efa1b5eedf8d1011b5c0","abstract_canon_sha256":"ef9bd1765028c56cef649334892e46b57839ad4a2340e2e0bced8bd5bf0c9754"},"schema_version":"1.0"},"canonical_sha256":"9dd9358e424176df1b378432459f0fe21b5a3fb5364d9b102badd9fb1fc653f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:18.035141Z","signature_b64":"ocZNYrZZieF8HgtUMHuj94EnP3i5iUStTw8PPCtI+yRvH9XwIAchLEcHPBmbAW58GwNFIj7P4yHuA0c2WLChCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dd9358e424176df1b378432459f0fe21b5a3fb5364d9b102badd9fb1fc653f7","last_reissued_at":"2026-05-18T00:52:18.034679Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:18.034679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.2304","source_version":2,"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:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7ffS+AgNgSayQpKBdGm536yidkpVmSYOwJcpjePWpVbondK3C9lmNoyZqwTDOkNPJfLI9DA7Jyr8u4T8JECAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:53:01.310242Z"},"content_sha256":"8397b7532618d09be739e15a1d6de9acdbb53f45e23bca4738c93d56a1b885ad","schema_version":"1.0","event_id":"sha256:8397b7532618d09be739e15a1d6de9acdbb53f45e23bca4738c93d56a1b885ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TXMTLDSCIF3N6GZXQQZELHYP4I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Minimization of Higher Order Submodular Functions using Monotonic Boolean Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DM"],"primary_cat":"cs.DS","authors_text":"Chris Russell, Lubor Ladicky, Philip H.S. Torr, Srikumar Ramalingam","submitted_at":"2011-09-11T10:58:44Z","abstract_excerpt":"Submodular function minimization is a key problem in a wide variety of applications in machine learning, economics, game theory, computer vision, and many others. The general solver has a complexity of $O(n^3 \\log^2 n . E +n^4 {\\log}^{O(1)} n)$ where $E$ is the time required to evaluate the function and $n$ is the number of variables \\cite{Lee2015}. On the other hand, many computer vision and machine learning problems are defined over special subclasses of submodular functions that can be written as the sum of many submodular cost functions defined over cliques containing few variables. In suc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2304","kind":"arxiv","version":2},"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:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Umufoubc05GNahfSDKXf54pXdNU74cdn0i2/XzWx6XNd+VHSgR2LM6YePLwaWTYh9V3m9Sl7kX0fegP3k1eSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:53:01.310608Z"},"content_sha256":"7237e1078c2491b1a2d7773ed7ab7b5351676b001342eecd773514ae51650da4","schema_version":"1.0","event_id":"sha256:7237e1078c2491b1a2d7773ed7ab7b5351676b001342eecd773514ae51650da4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TXMTLDSCIF3N6GZXQQZELHYP4I/bundle.json","state_url":"https://pith.science/pith/TXMTLDSCIF3N6GZXQQZELHYP4I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TXMTLDSCIF3N6GZXQQZELHYP4I/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-02T02:53:01Z","links":{"resolver":"https://pith.science/pith/TXMTLDSCIF3N6GZXQQZELHYP4I","bundle":"https://pith.science/pith/TXMTLDSCIF3N6GZXQQZELHYP4I/bundle.json","state":"https://pith.science/pith/TXMTLDSCIF3N6GZXQQZELHYP4I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TXMTLDSCIF3N6GZXQQZELHYP4I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TXMTLDSCIF3N6GZXQQZELHYP4I","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":"ef9bd1765028c56cef649334892e46b57839ad4a2340e2e0bced8bd5bf0c9754","cross_cats_sorted":["cs.CV","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-11T10:58:44Z","title_canon_sha256":"91c9c1304a30c3659857c090020aac1c141960ca3b52efa1b5eedf8d1011b5c0"},"schema_version":"1.0","source":{"id":"1109.2304","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2304","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2304v2","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2304","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"TXMTLDSCIF3N","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TXMTLDSCIF3N6GZX","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TXMTLDSC","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:7237e1078c2491b1a2d7773ed7ab7b5351676b001342eecd773514ae51650da4","target":"graph","created_at":"2026-05-18T00:52:18Z","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":"Submodular function minimization is a key problem in a wide variety of applications in machine learning, economics, game theory, computer vision, and many others. The general solver has a complexity of $O(n^3 \\log^2 n . E +n^4 {\\log}^{O(1)} n)$ where $E$ is the time required to evaluate the function and $n$ is the number of variables \\cite{Lee2015}. On the other hand, many computer vision and machine learning problems are defined over special subclasses of submodular functions that can be written as the sum of many submodular cost functions defined over cliques containing few variables. In suc","authors_text":"Chris Russell, Lubor Ladicky, Philip H.S. Torr, Srikumar Ramalingam","cross_cats":["cs.CV","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-11T10:58:44Z","title":"Efficient Minimization of Higher Order Submodular Functions using Monotonic Boolean Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2304","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:8397b7532618d09be739e15a1d6de9acdbb53f45e23bca4738c93d56a1b885ad","target":"record","created_at":"2026-05-18T00:52:18Z","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":"ef9bd1765028c56cef649334892e46b57839ad4a2340e2e0bced8bd5bf0c9754","cross_cats_sorted":["cs.CV","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-11T10:58:44Z","title_canon_sha256":"91c9c1304a30c3659857c090020aac1c141960ca3b52efa1b5eedf8d1011b5c0"},"schema_version":"1.0","source":{"id":"1109.2304","kind":"arxiv","version":2}},"canonical_sha256":"9dd9358e424176df1b378432459f0fe21b5a3fb5364d9b102badd9fb1fc653f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9dd9358e424176df1b378432459f0fe21b5a3fb5364d9b102badd9fb1fc653f7","first_computed_at":"2026-05-18T00:52:18.034679Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:18.034679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ocZNYrZZieF8HgtUMHuj94EnP3i5iUStTw8PPCtI+yRvH9XwIAchLEcHPBmbAW58GwNFIj7P4yHuA0c2WLChCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:18.035141Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2304","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8397b7532618d09be739e15a1d6de9acdbb53f45e23bca4738c93d56a1b885ad","sha256:7237e1078c2491b1a2d7773ed7ab7b5351676b001342eecd773514ae51650da4"],"state_sha256":"92fb1ac3fb7e2271e72a65b75be07f749380859635d803e37b048577dff4d7fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zK12bXCQXUGZSJ5HQyqIG5moTcfsTEh2WlIqIqnATQHaDuy/pBUekIhdPSdkQTB1NEUCouTBsl1oj+JUkhJYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:53:01.312625Z","bundle_sha256":"8d0894878c05eb91b0a0ac56a822ed6d8600e0abfd99f65aa91bcb4855b1808e"}}