{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7F6CDCGYDAVTGHD5AARVVHM4UP","short_pith_number":"pith:7F6CDCGY","canonical_record":{"source":{"id":"1911.06889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-15T21:45:14Z","cross_cats_sorted":[],"title_canon_sha256":"16edbd0658a5bb7079971ff3431f2dcb8fed997209087832a7efaa06789d3397","abstract_canon_sha256":"ec9b5839fd6f3ccd474ad1ccf0981be32173834d90936e11576d96fa313b972c"},"schema_version":"1.0"},"canonical_sha256":"f97c2188d8182b331c7d00235a9d9ca3c52cd700f7c053a29b5a25f77f6b6efa","source":{"kind":"arxiv","id":"1911.06889","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.06889","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"arxiv_version","alias_value":"1911.06889v1","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.06889","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"pith_short_12","alias_value":"7F6CDCGYDAVT","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"pith_short_16","alias_value":"7F6CDCGYDAVTGHD5","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"pith_short_8","alias_value":"7F6CDCGY","created_at":"2026-07-05T00:19:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7F6CDCGYDAVTGHD5AARVVHM4UP","target":"record","payload":{"canonical_record":{"source":{"id":"1911.06889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-15T21:45:14Z","cross_cats_sorted":[],"title_canon_sha256":"16edbd0658a5bb7079971ff3431f2dcb8fed997209087832a7efaa06789d3397","abstract_canon_sha256":"ec9b5839fd6f3ccd474ad1ccf0981be32173834d90936e11576d96fa313b972c"},"schema_version":"1.0"},"canonical_sha256":"f97c2188d8182b331c7d00235a9d9ca3c52cd700f7c053a29b5a25f77f6b6efa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:19:40.426260Z","signature_b64":"ziv5vlP8NqEG32ResBEnPle0s6+Z0gNY/Bhf8hWnjmgxaimfPlSE6Im3cBNAmHGk79vhou5t5dMnpJWA1BFSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f97c2188d8182b331c7d00235a9d9ca3c52cd700f7c053a29b5a25f77f6b6efa","last_reissued_at":"2026-07-05T00:19:40.425793Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:19:40.425793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.06889","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-07-05T00:19:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ShYMzQZ4Z9knEK72jl3fuIXYR1R6XWdH18txDkEPRY8I9rkq82GtKPND5DjAHxkuCvcgKdR71qqge+txmOJ8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T03:56:15.268809Z"},"content_sha256":"287f4006357fc7c4170397389d2d27cf7bc79e5fcc8872801e654acd7320050a","schema_version":"1.0","event_id":"sha256:287f4006357fc7c4170397389d2d27cf7bc79e5fcc8872801e654acd7320050a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7F6CDCGYDAVTGHD5AARVVHM4UP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Query Lower Bounds for Submodular Function MInimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrei Graur, S. Matthew Weinberg, Tristan Pollner, Vidhya Ramaswamy","submitted_at":"2019-11-15T21:45:14Z","abstract_excerpt":"We consider submodular function minimization in the oracle model: given black-box access to a submodular set function $f:2^{[n]}\\rightarrow \\mathbb{R}$, find an element of $\\arg\\min_S \\{f(S)\\}$ using as few queries to $f(\\cdot)$ as possible. State-of-the-art algorithms succeed with $\\tilde{O}(n^2)$ queries [LeeSW15], yet the best-known lower bound has never been improved beyond $n$ [Harvey08].\n  We provide a query lower bound of $2n$ for submodular function minimization, a $3n/2-2$ query lower bound for the non-trivial minimizer of a symmetric submodular function, and a $\\binom{n}{2}$ query lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.06889","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.06889/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:19:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zdLDMnsINRdZBRRgQb3QO5IF3gMsXj+pwhnnhBSyu/crXZGN91zjDsoiYh1SrbF7sBOllpig1ZP5Vt+Nm86MAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T03:56:15.269183Z"},"content_sha256":"0d6e06cc51480f7bd6fa6a515e4bc1d1d1174c22ef054d84c15b5c7ca676046c","schema_version":"1.0","event_id":"sha256:0d6e06cc51480f7bd6fa6a515e4bc1d1d1174c22ef054d84c15b5c7ca676046c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7F6CDCGYDAVTGHD5AARVVHM4UP/bundle.json","state_url":"https://pith.science/pith/7F6CDCGYDAVTGHD5AARVVHM4UP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7F6CDCGYDAVTGHD5AARVVHM4UP/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-07-09T03:56:15Z","links":{"resolver":"https://pith.science/pith/7F6CDCGYDAVTGHD5AARVVHM4UP","bundle":"https://pith.science/pith/7F6CDCGYDAVTGHD5AARVVHM4UP/bundle.json","state":"https://pith.science/pith/7F6CDCGYDAVTGHD5AARVVHM4UP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7F6CDCGYDAVTGHD5AARVVHM4UP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7F6CDCGYDAVTGHD5AARVVHM4UP","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":"ec9b5839fd6f3ccd474ad1ccf0981be32173834d90936e11576d96fa313b972c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-15T21:45:14Z","title_canon_sha256":"16edbd0658a5bb7079971ff3431f2dcb8fed997209087832a7efaa06789d3397"},"schema_version":"1.0","source":{"id":"1911.06889","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.06889","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"arxiv_version","alias_value":"1911.06889v1","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.06889","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"pith_short_12","alias_value":"7F6CDCGYDAVT","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"pith_short_16","alias_value":"7F6CDCGYDAVTGHD5","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"pith_short_8","alias_value":"7F6CDCGY","created_at":"2026-07-05T00:19:40Z"}],"graph_snapshots":[{"event_id":"sha256:0d6e06cc51480f7bd6fa6a515e4bc1d1d1174c22ef054d84c15b5c7ca676046c","target":"graph","created_at":"2026-07-05T00:19:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.06889/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider submodular function minimization in the oracle model: given black-box access to a submodular set function $f:2^{[n]}\\rightarrow \\mathbb{R}$, find an element of $\\arg\\min_S \\{f(S)\\}$ using as few queries to $f(\\cdot)$ as possible. State-of-the-art algorithms succeed with $\\tilde{O}(n^2)$ queries [LeeSW15], yet the best-known lower bound has never been improved beyond $n$ [Harvey08].\n  We provide a query lower bound of $2n$ for submodular function minimization, a $3n/2-2$ query lower bound for the non-trivial minimizer of a symmetric submodular function, and a $\\binom{n}{2}$ query lo","authors_text":"Andrei Graur, S. Matthew Weinberg, Tristan Pollner, Vidhya Ramaswamy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-15T21:45:14Z","title":"New Query Lower Bounds for Submodular Function MInimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.06889","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:287f4006357fc7c4170397389d2d27cf7bc79e5fcc8872801e654acd7320050a","target":"record","created_at":"2026-07-05T00:19:40Z","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":"ec9b5839fd6f3ccd474ad1ccf0981be32173834d90936e11576d96fa313b972c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-15T21:45:14Z","title_canon_sha256":"16edbd0658a5bb7079971ff3431f2dcb8fed997209087832a7efaa06789d3397"},"schema_version":"1.0","source":{"id":"1911.06889","kind":"arxiv","version":1}},"canonical_sha256":"f97c2188d8182b331c7d00235a9d9ca3c52cd700f7c053a29b5a25f77f6b6efa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f97c2188d8182b331c7d00235a9d9ca3c52cd700f7c053a29b5a25f77f6b6efa","first_computed_at":"2026-07-05T00:19:40.425793Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:19:40.425793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ziv5vlP8NqEG32ResBEnPle0s6+Z0gNY/Bhf8hWnjmgxaimfPlSE6Im3cBNAmHGk79vhou5t5dMnpJWA1BFSAw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:19:40.426260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.06889","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:287f4006357fc7c4170397389d2d27cf7bc79e5fcc8872801e654acd7320050a","sha256:0d6e06cc51480f7bd6fa6a515e4bc1d1d1174c22ef054d84c15b5c7ca676046c"],"state_sha256":"1c6d5acd1f60ab3cd696ea07a4f41b55d9976cf974326fc66c0020b7dd9434d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y96STNSXN0zEDdep+BahwVK3rS3XKhA06/Y97vgSF4sxykdSoTPw283dZL9vNFzUI+GCnhAA7e4W98tBl2v4Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T03:56:15.271142Z","bundle_sha256":"6874a12134552df0e7d8d5f8f9c112204f1135e146cd9584294d4f5969efb89d"}}