{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GJCLCDHBU5O4PTXUBAR2DQYELY","short_pith_number":"pith:GJCLCDHB","canonical_record":{"source":{"id":"1610.09800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-31T06:13:41Z","cross_cats_sorted":[],"title_canon_sha256":"41113eee4918a1f39d31b524b37dafa4133d7a993092d084dc286e99f3d6e0aa","abstract_canon_sha256":"d9e0b89699f43d9450278de008363a6ef1959199721976998d80af18523f8580"},"schema_version":"1.0"},"canonical_sha256":"3244b10ce1a75dc7cef40823a1c3045e13d7bf131ba8f3c33be9c37020badaa2","source":{"kind":"arxiv","id":"1610.09800","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09800","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09800v1","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09800","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"pith_short_12","alias_value":"GJCLCDHBU5O4","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GJCLCDHBU5O4PTXU","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GJCLCDHB","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GJCLCDHBU5O4PTXUBAR2DQYELY","target":"record","payload":{"canonical_record":{"source":{"id":"1610.09800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-31T06:13:41Z","cross_cats_sorted":[],"title_canon_sha256":"41113eee4918a1f39d31b524b37dafa4133d7a993092d084dc286e99f3d6e0aa","abstract_canon_sha256":"d9e0b89699f43d9450278de008363a6ef1959199721976998d80af18523f8580"},"schema_version":"1.0"},"canonical_sha256":"3244b10ce1a75dc7cef40823a1c3045e13d7bf131ba8f3c33be9c37020badaa2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:47.160414Z","signature_b64":"Gr0IDqoz5ap2XpC/Bjp7nsBdhIK7D/QjFVa2p8ZCMBLMpN/s2tqVz4y0ruwj0RfTy6MQf4XJHH/7DYN6CPNnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3244b10ce1a75dc7cef40823a1c3045e13d7bf131ba8f3c33be9c37020badaa2","last_reissued_at":"2026-05-18T01:00:47.159993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:47.159993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.09800","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-18T01:00:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jlpw49SFu3kHCKMOvXHRU/VrAb7hNBfJ8Xt6EMqxUS+27IEfKBi2q133oTzcyY5I13XkQdYIsstbSnyr6AEDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:55:27.538519Z"},"content_sha256":"c5a3f65d95aff0d5b6c8bb738f5385a11af0418ea776afad89f39e08dcd79c62","schema_version":"1.0","event_id":"sha256:c5a3f65d95aff0d5b6c8bb738f5385a11af0418ea776afad89f39e08dcd79c62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GJCLCDHBU5O4PTXUBAR2DQYELY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subquadratic Submodular Function Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Deeparnab Chakrabarty, Sam Chiu-wai Wong, Yin Tat Lee","submitted_at":"2016-10-31T06:13:41Z","abstract_excerpt":"Submodular function minimization (SFM) is a fundamental discrete optimization problem which generalizes many well known problems, has applications in various fields, and can be solved in polynomial time. Owing to applications in computer vision and machine learning, fast SFM algorithms are highly desirable. The current fastest algorithms [Lee, Sidford, Wong, FOCS 2015] run in $O(n^{2}\\log nM\\cdot\\textrm{EO} +n^{3}\\log^{O(1)}nM)$ time and $O(n^{3}\\log^{2}n\\cdot \\textrm{EO} +n^{4}\\log^{O(1)}n$) time respectively, where $M$ is the largest absolute value of the function (assuming the range is inte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09800","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-18T01:00:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/bpy8NqPbIwTE3yfwDxL/4CMawQz+ZjqfEC78OaBw1oBV688cJsfVlIcGZ2GiOITno6o7o68ixhCb1VDE7mAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:55:27.538871Z"},"content_sha256":"3b81e959b802750453411d4121f840c31f658eafd31a97961df45ace945e78d4","schema_version":"1.0","event_id":"sha256:3b81e959b802750453411d4121f840c31f658eafd31a97961df45ace945e78d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJCLCDHBU5O4PTXUBAR2DQYELY/bundle.json","state_url":"https://pith.science/pith/GJCLCDHBU5O4PTXUBAR2DQYELY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJCLCDHBU5O4PTXUBAR2DQYELY/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-01T15:55:27Z","links":{"resolver":"https://pith.science/pith/GJCLCDHBU5O4PTXUBAR2DQYELY","bundle":"https://pith.science/pith/GJCLCDHBU5O4PTXUBAR2DQYELY/bundle.json","state":"https://pith.science/pith/GJCLCDHBU5O4PTXUBAR2DQYELY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJCLCDHBU5O4PTXUBAR2DQYELY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GJCLCDHBU5O4PTXUBAR2DQYELY","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":"d9e0b89699f43d9450278de008363a6ef1959199721976998d80af18523f8580","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-31T06:13:41Z","title_canon_sha256":"41113eee4918a1f39d31b524b37dafa4133d7a993092d084dc286e99f3d6e0aa"},"schema_version":"1.0","source":{"id":"1610.09800","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09800","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09800v1","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09800","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"pith_short_12","alias_value":"GJCLCDHBU5O4","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GJCLCDHBU5O4PTXU","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GJCLCDHB","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:3b81e959b802750453411d4121f840c31f658eafd31a97961df45ace945e78d4","target":"graph","created_at":"2026-05-18T01:00:47Z","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 (SFM) is a fundamental discrete optimization problem which generalizes many well known problems, has applications in various fields, and can be solved in polynomial time. Owing to applications in computer vision and machine learning, fast SFM algorithms are highly desirable. The current fastest algorithms [Lee, Sidford, Wong, FOCS 2015] run in $O(n^{2}\\log nM\\cdot\\textrm{EO} +n^{3}\\log^{O(1)}nM)$ time and $O(n^{3}\\log^{2}n\\cdot \\textrm{EO} +n^{4}\\log^{O(1)}n$) time respectively, where $M$ is the largest absolute value of the function (assuming the range is inte","authors_text":"Aaron Sidford, Deeparnab Chakrabarty, Sam Chiu-wai Wong, Yin Tat Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-31T06:13:41Z","title":"Subquadratic Submodular Function Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09800","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:c5a3f65d95aff0d5b6c8bb738f5385a11af0418ea776afad89f39e08dcd79c62","target":"record","created_at":"2026-05-18T01:00:47Z","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":"d9e0b89699f43d9450278de008363a6ef1959199721976998d80af18523f8580","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-31T06:13:41Z","title_canon_sha256":"41113eee4918a1f39d31b524b37dafa4133d7a993092d084dc286e99f3d6e0aa"},"schema_version":"1.0","source":{"id":"1610.09800","kind":"arxiv","version":1}},"canonical_sha256":"3244b10ce1a75dc7cef40823a1c3045e13d7bf131ba8f3c33be9c37020badaa2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3244b10ce1a75dc7cef40823a1c3045e13d7bf131ba8f3c33be9c37020badaa2","first_computed_at":"2026-05-18T01:00:47.159993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:47.159993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gr0IDqoz5ap2XpC/Bjp7nsBdhIK7D/QjFVa2p8ZCMBLMpN/s2tqVz4y0ruwj0RfTy6MQf4XJHH/7DYN6CPNnCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:47.160414Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.09800","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5a3f65d95aff0d5b6c8bb738f5385a11af0418ea776afad89f39e08dcd79c62","sha256:3b81e959b802750453411d4121f840c31f658eafd31a97961df45ace945e78d4"],"state_sha256":"ecaabadd207a8029507309ad86ee8c882c1102fc792581af11fb0adf727363d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c1EUG1yTQx5mIjmawz3gkBK3Ba0ouRDrv5fWncyIP5mxK3TgXF5BmigSzjz0xe40ypBn0lMOwzk4Nom6M9tpAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:55:27.540798Z","bundle_sha256":"b7d983c79e45a4466448d6edb7383584d0e613f33f056373745e584ab0288682"}}