{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:KZZCURPGXYJLIOMK6APXG333WY","short_pith_number":"pith:KZZCURPG","canonical_record":{"source":{"id":"2308.10656","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-21T11:48:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ff65938556b4d9eaa1b4387313eaa76b5ad6ebb650524c5a9213c96fea65a6ff","abstract_canon_sha256":"8b7b0947ea75d2a736e8a1c81d1c588172d45d753f221f72a120fa0150093009"},"schema_version":"1.0"},"canonical_sha256":"56722a45e6be12b4398af01f736f7bb6093b516fc0840947dfcd4802172e3c3b","source":{"kind":"arxiv","id":"2308.10656","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.10656","created_at":"2026-07-05T09:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"2308.10656v2","created_at":"2026-07-05T09:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.10656","created_at":"2026-07-05T09:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"KZZCURPGXYJL","created_at":"2026-07-05T09:43:23Z"},{"alias_kind":"pith_short_16","alias_value":"KZZCURPGXYJLIOMK","created_at":"2026-07-05T09:43:23Z"},{"alias_kind":"pith_short_8","alias_value":"KZZCURPG","created_at":"2026-07-05T09:43:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:KZZCURPGXYJLIOMK6APXG333WY","target":"record","payload":{"canonical_record":{"source":{"id":"2308.10656","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-21T11:48:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ff65938556b4d9eaa1b4387313eaa76b5ad6ebb650524c5a9213c96fea65a6ff","abstract_canon_sha256":"8b7b0947ea75d2a736e8a1c81d1c588172d45d753f221f72a120fa0150093009"},"schema_version":"1.0"},"canonical_sha256":"56722a45e6be12b4398af01f736f7bb6093b516fc0840947dfcd4802172e3c3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:43:23.168879Z","signature_b64":"augFXYK2ZWt3DsSybzniwUECk2cLvrSSU0AHGSYVTVtY70S+AKs3PNUIc5ByMyv1dd9BY0cbyMCXBclS+ZgtAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56722a45e6be12b4398af01f736f7bb6093b516fc0840947dfcd4802172e3c3b","last_reissued_at":"2026-07-05T09:43:23.168390Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:43:23.168390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.10656","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-07-05T09:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EjCPLpaY1QLoAQxQdFK1bbftd+5EXiJyxTN2obFG60cnFOiveveTTza6cJADrLE+Oihr56jbOADg2yliead/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:54:50.846358Z"},"content_sha256":"600b67d5973f9307035bed0f7f6c7b43c8e12713bf05d363efa52b60ab7f040b","schema_version":"1.0","event_id":"sha256:600b67d5973f9307035bed0f7f6c7b43c8e12713bf05d363efa52b60ab7f040b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:KZZCURPGXYJLIOMK6APXG333WY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical Parallel Algorithms for Non-Monotone Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Aakas Zhiyuli, Hanxiao Li, Jing Tang, Kai Han, Shuang Cui, Xueying Li","submitted_at":"2023-08-21T11:48:34Z","abstract_excerpt":"Submodular maximization has found extensive applications in various domains within the field of artificial intelligence, including but not limited to machine learning, computer vision, and natural language processing. With the increasing size of datasets in these domains, there is a pressing need to develop efficient and parallelizable algorithms for submodular maximization. One measure of the parallelizability of a submodular maximization algorithm is its adaptive complexity, which indicates the number of sequential rounds where a polynomial number of queries to the objective function can be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.10656","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.10656/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-05T09:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8BSOiUbB7GCobbk+4CNwGdPKCvvUadP4HO9VWbkrwrXA3B0+IBuZ1cLcBunQbzXO5KF/pmuuh3PIRcRd3IH9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:54:50.847402Z"},"content_sha256":"c90de298ca46e609efd3ce9beac20f37324ca214a52d67dbd75066e88b6856ce","schema_version":"1.0","event_id":"sha256:c90de298ca46e609efd3ce9beac20f37324ca214a52d67dbd75066e88b6856ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KZZCURPGXYJLIOMK6APXG333WY/bundle.json","state_url":"https://pith.science/pith/KZZCURPGXYJLIOMK6APXG333WY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KZZCURPGXYJLIOMK6APXG333WY/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-05T13:54:50Z","links":{"resolver":"https://pith.science/pith/KZZCURPGXYJLIOMK6APXG333WY","bundle":"https://pith.science/pith/KZZCURPGXYJLIOMK6APXG333WY/bundle.json","state":"https://pith.science/pith/KZZCURPGXYJLIOMK6APXG333WY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KZZCURPGXYJLIOMK6APXG333WY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:KZZCURPGXYJLIOMK6APXG333WY","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":"8b7b0947ea75d2a736e8a1c81d1c588172d45d753f221f72a120fa0150093009","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-21T11:48:34Z","title_canon_sha256":"ff65938556b4d9eaa1b4387313eaa76b5ad6ebb650524c5a9213c96fea65a6ff"},"schema_version":"1.0","source":{"id":"2308.10656","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.10656","created_at":"2026-07-05T09:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"2308.10656v2","created_at":"2026-07-05T09:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.10656","created_at":"2026-07-05T09:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"KZZCURPGXYJL","created_at":"2026-07-05T09:43:23Z"},{"alias_kind":"pith_short_16","alias_value":"KZZCURPGXYJLIOMK","created_at":"2026-07-05T09:43:23Z"},{"alias_kind":"pith_short_8","alias_value":"KZZCURPG","created_at":"2026-07-05T09:43:23Z"}],"graph_snapshots":[{"event_id":"sha256:c90de298ca46e609efd3ce9beac20f37324ca214a52d67dbd75066e88b6856ce","target":"graph","created_at":"2026-07-05T09:43:23Z","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/2308.10656/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Submodular maximization has found extensive applications in various domains within the field of artificial intelligence, including but not limited to machine learning, computer vision, and natural language processing. With the increasing size of datasets in these domains, there is a pressing need to develop efficient and parallelizable algorithms for submodular maximization. One measure of the parallelizability of a submodular maximization algorithm is its adaptive complexity, which indicates the number of sequential rounds where a polynomial number of queries to the objective function can be ","authors_text":"Aakas Zhiyuli, Hanxiao Li, Jing Tang, Kai Han, Shuang Cui, Xueying Li","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-21T11:48:34Z","title":"Practical Parallel Algorithms for Non-Monotone Submodular Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.10656","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:600b67d5973f9307035bed0f7f6c7b43c8e12713bf05d363efa52b60ab7f040b","target":"record","created_at":"2026-07-05T09:43:23Z","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":"8b7b0947ea75d2a736e8a1c81d1c588172d45d753f221f72a120fa0150093009","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-21T11:48:34Z","title_canon_sha256":"ff65938556b4d9eaa1b4387313eaa76b5ad6ebb650524c5a9213c96fea65a6ff"},"schema_version":"1.0","source":{"id":"2308.10656","kind":"arxiv","version":2}},"canonical_sha256":"56722a45e6be12b4398af01f736f7bb6093b516fc0840947dfcd4802172e3c3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56722a45e6be12b4398af01f736f7bb6093b516fc0840947dfcd4802172e3c3b","first_computed_at":"2026-07-05T09:43:23.168390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:43:23.168390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"augFXYK2ZWt3DsSybzniwUECk2cLvrSSU0AHGSYVTVtY70S+AKs3PNUIc5ByMyv1dd9BY0cbyMCXBclS+ZgtAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:43:23.168879Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.10656","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:600b67d5973f9307035bed0f7f6c7b43c8e12713bf05d363efa52b60ab7f040b","sha256:c90de298ca46e609efd3ce9beac20f37324ca214a52d67dbd75066e88b6856ce"],"state_sha256":"ce460ae6386397d783c3e8c64ab6f0db0c19a8e1aa7b63e33932e076c18179c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dqLlehpmEbxEAz7aTVlHS9dSASyu4mA22muSBFVo3BIKga6UBFDZOEvBlLUty8dznibSW4AKnPtQPO3ToSacCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T13:54:50.858017Z","bundle_sha256":"74e4ce90bf7a5bf937793ff16dc26316896817f4ec81b9a24ced5111396baa29"}}