{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XNEL5GQWNAQJ7KPEDZPXZJQK7R","short_pith_number":"pith:XNEL5GQW","canonical_record":{"source":{"id":"2607.05759","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-07T02:34:10Z","cross_cats_sorted":["cs.AI","cs.DM"],"title_canon_sha256":"435f049af8a7012022d1de2f802bc7db4a7e457492fe0dcf17fe90054028f96b","abstract_canon_sha256":"4a9908446782e1f770966bcc775a2445a56ec010f32e96a406f8b38c7425b70b"},"schema_version":"1.0"},"canonical_sha256":"bb48be9a1668209fa9e41e5f7ca60afc76bc34f65ca5123b6d8d648186482a76","source":{"kind":"arxiv","id":"2607.05759","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.05759","created_at":"2026-07-08T01:18:44Z"},{"alias_kind":"arxiv_version","alias_value":"2607.05759v1","created_at":"2026-07-08T01:18:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05759","created_at":"2026-07-08T01:18:44Z"},{"alias_kind":"pith_short_12","alias_value":"XNEL5GQWNAQJ","created_at":"2026-07-08T01:18:44Z"},{"alias_kind":"pith_short_16","alias_value":"XNEL5GQWNAQJ7KPE","created_at":"2026-07-08T01:18:44Z"},{"alias_kind":"pith_short_8","alias_value":"XNEL5GQW","created_at":"2026-07-08T01:18:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XNEL5GQWNAQJ7KPEDZPXZJQK7R","target":"record","payload":{"canonical_record":{"source":{"id":"2607.05759","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-07T02:34:10Z","cross_cats_sorted":["cs.AI","cs.DM"],"title_canon_sha256":"435f049af8a7012022d1de2f802bc7db4a7e457492fe0dcf17fe90054028f96b","abstract_canon_sha256":"4a9908446782e1f770966bcc775a2445a56ec010f32e96a406f8b38c7425b70b"},"schema_version":"1.0"},"canonical_sha256":"bb48be9a1668209fa9e41e5f7ca60afc76bc34f65ca5123b6d8d648186482a76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-08T01:18:44.066710Z","signature_b64":"d+bkJ+9+/x+SZE+QulHvXGJJHJrLiMP9N44j9qkL/lPN3KbZaqVeWQg5sK6u+PIRIX1tMzkbwtFz7Ii2BkBWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb48be9a1668209fa9e41e5f7ca60afc76bc34f65ca5123b6d8d648186482a76","last_reissued_at":"2026-07-08T01:18:44.066260Z","signature_status":"signed_v1","first_computed_at":"2026-07-08T01:18:44.066260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.05759","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-08T01:18:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8gozKL5HguOTRJmJfKOMEklBjijnG5kKOf86vyZi4iPo1TQZgMFZulPPBIf32wWUPaKaA8pK3wgD7kFE4i4DBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T08:04:56.440083Z"},"content_sha256":"a47c52de874a60dce1c47afc2fa98cd2ffc2515b8588fc93cfc8a34161b6a1d1","schema_version":"1.0","event_id":"sha256:a47c52de874a60dce1c47afc2fa98cd2ffc2515b8588fc93cfc8a34161b6a1d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XNEL5GQWNAQJ7KPEDZPXZJQK7R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data-dependent Evaluations for Budgeted Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM"],"primary_cat":"cs.DS","authors_text":"Jing Tang, Lejian Zhang, Xueyan Tang","submitted_at":"2026-07-07T02:34:10Z","abstract_excerpt":"Submodular maximization is an important building block for developing algorithms in many areas such as machine learning and data mining. Due to the NP-hardness of the problem, analysis of submodular maximization algorithms typically provides pessimistic worst-case approximation factors only. It is not easy to evaluate how close a produced solution is to an optimal one for a given problem instance. In this paper, we develop new data-dependent upper bounds for submodular maximization with a knapsack constraint. We theoretically prove that they dominate the optimal solution and empirically demons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05759","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/2607.05759/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-08T01:18:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fHsNJuhpAp4PSXQo0QHvLE7mHjn0rgQTb0wVrpYKULArqXIZhcQ8PGCgt5t0AunHmlDPooPDvRMRFwvfLAW5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T08:04:56.440412Z"},"content_sha256":"20f27d3cb5e8a0d430532306dfba2854438c685e55a1f3280e148b6fad389d75","schema_version":"1.0","event_id":"sha256:20f27d3cb5e8a0d430532306dfba2854438c685e55a1f3280e148b6fad389d75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XNEL5GQWNAQJ7KPEDZPXZJQK7R/bundle.json","state_url":"https://pith.science/pith/XNEL5GQWNAQJ7KPEDZPXZJQK7R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XNEL5GQWNAQJ7KPEDZPXZJQK7R/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-08-22T08:04:56Z","links":{"resolver":"https://pith.science/pith/XNEL5GQWNAQJ7KPEDZPXZJQK7R","bundle":"https://pith.science/pith/XNEL5GQWNAQJ7KPEDZPXZJQK7R/bundle.json","state":"https://pith.science/pith/XNEL5GQWNAQJ7KPEDZPXZJQK7R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XNEL5GQWNAQJ7KPEDZPXZJQK7R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XNEL5GQWNAQJ7KPEDZPXZJQK7R","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":"4a9908446782e1f770966bcc775a2445a56ec010f32e96a406f8b38c7425b70b","cross_cats_sorted":["cs.AI","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-07T02:34:10Z","title_canon_sha256":"435f049af8a7012022d1de2f802bc7db4a7e457492fe0dcf17fe90054028f96b"},"schema_version":"1.0","source":{"id":"2607.05759","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.05759","created_at":"2026-07-08T01:18:44Z"},{"alias_kind":"arxiv_version","alias_value":"2607.05759v1","created_at":"2026-07-08T01:18:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05759","created_at":"2026-07-08T01:18:44Z"},{"alias_kind":"pith_short_12","alias_value":"XNEL5GQWNAQJ","created_at":"2026-07-08T01:18:44Z"},{"alias_kind":"pith_short_16","alias_value":"XNEL5GQWNAQJ7KPE","created_at":"2026-07-08T01:18:44Z"},{"alias_kind":"pith_short_8","alias_value":"XNEL5GQW","created_at":"2026-07-08T01:18:44Z"}],"graph_snapshots":[{"event_id":"sha256:20f27d3cb5e8a0d430532306dfba2854438c685e55a1f3280e148b6fad389d75","target":"graph","created_at":"2026-07-08T01:18:44Z","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/2607.05759/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Submodular maximization is an important building block for developing algorithms in many areas such as machine learning and data mining. Due to the NP-hardness of the problem, analysis of submodular maximization algorithms typically provides pessimistic worst-case approximation factors only. It is not easy to evaluate how close a produced solution is to an optimal one for a given problem instance. In this paper, we develop new data-dependent upper bounds for submodular maximization with a knapsack constraint. We theoretically prove that they dominate the optimal solution and empirically demons","authors_text":"Jing Tang, Lejian Zhang, Xueyan Tang","cross_cats":["cs.AI","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05759","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:a47c52de874a60dce1c47afc2fa98cd2ffc2515b8588fc93cfc8a34161b6a1d1","target":"record","created_at":"2026-07-08T01:18:44Z","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":"4a9908446782e1f770966bcc775a2445a56ec010f32e96a406f8b38c7425b70b","cross_cats_sorted":["cs.AI","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-07T02:34:10Z","title_canon_sha256":"435f049af8a7012022d1de2f802bc7db4a7e457492fe0dcf17fe90054028f96b"},"schema_version":"1.0","source":{"id":"2607.05759","kind":"arxiv","version":1}},"canonical_sha256":"bb48be9a1668209fa9e41e5f7ca60afc76bc34f65ca5123b6d8d648186482a76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb48be9a1668209fa9e41e5f7ca60afc76bc34f65ca5123b6d8d648186482a76","first_computed_at":"2026-07-08T01:18:44.066260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-08T01:18:44.066260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d+bkJ+9+/x+SZE+QulHvXGJJHJrLiMP9N44j9qkL/lPN3KbZaqVeWQg5sK6u+PIRIX1tMzkbwtFz7Ii2BkBWBA==","signature_status":"signed_v1","signed_at":"2026-07-08T01:18:44.066710Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.05759","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a47c52de874a60dce1c47afc2fa98cd2ffc2515b8588fc93cfc8a34161b6a1d1","sha256:20f27d3cb5e8a0d430532306dfba2854438c685e55a1f3280e148b6fad389d75"],"state_sha256":"362d8142e609964fc0d7d93d27165e6c6d05aaca4e09d1a9b020ee9b30a6f28c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yGbLw8ZI1wDMmXmH8dfL+gL7ZP8VgylpsTXCpb9wW0f5b8k0EyKQ+nYwMC+DnXJ2CiUcx654weH0ZzcTD8NpBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T08:04:56.443628Z","bundle_sha256":"3e14523fb65a026d215cad9ebe3b66ffe755cbbdb75f31898c18f9be5a19b48f"}}