{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:SRUTABO3WVO24LMDJK7SYS5NZI","short_pith_number":"pith:SRUTABO3","canonical_record":{"source":{"id":"2311.13123","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-22T02:50:33Z","cross_cats_sorted":[],"title_canon_sha256":"5fd9ff629591572686a4da38367400d2622bcead0938ca024f3e469ce7a0cbea","abstract_canon_sha256":"1fc69e26284bc46de39319aa59563a6f5e3b0ad220f703c6d7c0a23adf8bea05"},"schema_version":"1.0"},"canonical_sha256":"94693005dbb55dae2d834abf2c4badca3839d9fddbba3d8e7bf8aeb849990f38","source":{"kind":"arxiv","id":"2311.13123","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.13123","created_at":"2026-07-05T07:40:25Z"},{"alias_kind":"arxiv_version","alias_value":"2311.13123v2","created_at":"2026-07-05T07:40:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.13123","created_at":"2026-07-05T07:40:25Z"},{"alias_kind":"pith_short_12","alias_value":"SRUTABO3WVO2","created_at":"2026-07-05T07:40:25Z"},{"alias_kind":"pith_short_16","alias_value":"SRUTABO3WVO24LMD","created_at":"2026-07-05T07:40:25Z"},{"alias_kind":"pith_short_8","alias_value":"SRUTABO3","created_at":"2026-07-05T07:40:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:SRUTABO3WVO24LMDJK7SYS5NZI","target":"record","payload":{"canonical_record":{"source":{"id":"2311.13123","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-22T02:50:33Z","cross_cats_sorted":[],"title_canon_sha256":"5fd9ff629591572686a4da38367400d2622bcead0938ca024f3e469ce7a0cbea","abstract_canon_sha256":"1fc69e26284bc46de39319aa59563a6f5e3b0ad220f703c6d7c0a23adf8bea05"},"schema_version":"1.0"},"canonical_sha256":"94693005dbb55dae2d834abf2c4badca3839d9fddbba3d8e7bf8aeb849990f38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:40:25.299140Z","signature_b64":"RvdYFssAnZBhi9BrKg9PlY9FYtG4Ng8hYjpyOTnGo3I1dEqIgS88u3+kUrh/QD7d9ZuKwHcCVcpfmSfYD+N0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94693005dbb55dae2d834abf2c4badca3839d9fddbba3d8e7bf8aeb849990f38","last_reissued_at":"2026-07-05T07:40:25.298690Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:40:25.298690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.13123","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-05T07:40:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A6RThOlzpGsim+N/EFsGihtmv+ciOKC+D0sryqsdiHdegfETGOWzf53tpPvLxIP2fkgRYWHZJs4RajrZdIonBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:17:34.275647Z"},"content_sha256":"5596429ae8927391b1b956901ac2c1e616461810dad34a0d3038cb868b5d7d62","schema_version":"1.0","event_id":"sha256:5596429ae8927391b1b956901ac2c1e616461810dad34a0d3038cb868b5d7d62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:SRUTABO3WVO24LMDJK7SYS5NZI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anthony Wirth, Junhao Gan, Philip Cervenjak","submitted_at":"2023-11-22T02:50:33Z","abstract_excerpt":"Maximizing a non-negative, monontone, submodular function $f$ over $n$ elements under a cardinality constraint $k$ (SMCC) is a well-studied NP-hard problem. It has important applications in, e.g., machine learning and influence maximization. Though the theoretical problem admits polynomial-time approximation algorithms, solving it in practice often involves frequently querying submodular functions that are expensive to compute. This has motivated significant research into designing parallel approximation algorithms in the adaptive complexity model; adaptive complexity (adaptivity) measures the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.13123","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/2311.13123/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-05T07:40:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3CHhv7Un7YT2Lz5yvQpsYVtdSIn4RQ714tedtbGew6ytw2Eh7R0GyNZ7ARTZ2hkCFILCWNjST5km1o69XqZsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:17:34.276217Z"},"content_sha256":"5c3d565a423230e03ea0cc7ca5306b13acc5105e938495eb77276b472b173731","schema_version":"1.0","event_id":"sha256:5c3d565a423230e03ea0cc7ca5306b13acc5105e938495eb77276b472b173731"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SRUTABO3WVO24LMDJK7SYS5NZI/bundle.json","state_url":"https://pith.science/pith/SRUTABO3WVO24LMDJK7SYS5NZI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SRUTABO3WVO24LMDJK7SYS5NZI/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-09T00:17:34Z","links":{"resolver":"https://pith.science/pith/SRUTABO3WVO24LMDJK7SYS5NZI","bundle":"https://pith.science/pith/SRUTABO3WVO24LMDJK7SYS5NZI/bundle.json","state":"https://pith.science/pith/SRUTABO3WVO24LMDJK7SYS5NZI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SRUTABO3WVO24LMDJK7SYS5NZI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:SRUTABO3WVO24LMDJK7SYS5NZI","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":"1fc69e26284bc46de39319aa59563a6f5e3b0ad220f703c6d7c0a23adf8bea05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-22T02:50:33Z","title_canon_sha256":"5fd9ff629591572686a4da38367400d2622bcead0938ca024f3e469ce7a0cbea"},"schema_version":"1.0","source":{"id":"2311.13123","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.13123","created_at":"2026-07-05T07:40:25Z"},{"alias_kind":"arxiv_version","alias_value":"2311.13123v2","created_at":"2026-07-05T07:40:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.13123","created_at":"2026-07-05T07:40:25Z"},{"alias_kind":"pith_short_12","alias_value":"SRUTABO3WVO2","created_at":"2026-07-05T07:40:25Z"},{"alias_kind":"pith_short_16","alias_value":"SRUTABO3WVO24LMD","created_at":"2026-07-05T07:40:25Z"},{"alias_kind":"pith_short_8","alias_value":"SRUTABO3","created_at":"2026-07-05T07:40:25Z"}],"graph_snapshots":[{"event_id":"sha256:5c3d565a423230e03ea0cc7ca5306b13acc5105e938495eb77276b472b173731","target":"graph","created_at":"2026-07-05T07:40:25Z","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/2311.13123/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Maximizing a non-negative, monontone, submodular function $f$ over $n$ elements under a cardinality constraint $k$ (SMCC) is a well-studied NP-hard problem. It has important applications in, e.g., machine learning and influence maximization. Though the theoretical problem admits polynomial-time approximation algorithms, solving it in practice often involves frequently querying submodular functions that are expensive to compute. This has motivated significant research into designing parallel approximation algorithms in the adaptive complexity model; adaptive complexity (adaptivity) measures the","authors_text":"Anthony Wirth, Junhao Gan, Philip Cervenjak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-22T02:50:33Z","title":"Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.13123","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:5596429ae8927391b1b956901ac2c1e616461810dad34a0d3038cb868b5d7d62","target":"record","created_at":"2026-07-05T07:40:25Z","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":"1fc69e26284bc46de39319aa59563a6f5e3b0ad220f703c6d7c0a23adf8bea05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-22T02:50:33Z","title_canon_sha256":"5fd9ff629591572686a4da38367400d2622bcead0938ca024f3e469ce7a0cbea"},"schema_version":"1.0","source":{"id":"2311.13123","kind":"arxiv","version":2}},"canonical_sha256":"94693005dbb55dae2d834abf2c4badca3839d9fddbba3d8e7bf8aeb849990f38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94693005dbb55dae2d834abf2c4badca3839d9fddbba3d8e7bf8aeb849990f38","first_computed_at":"2026-07-05T07:40:25.298690Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:40:25.298690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RvdYFssAnZBhi9BrKg9PlY9FYtG4Ng8hYjpyOTnGo3I1dEqIgS88u3+kUrh/QD7d9ZuKwHcCVcpfmSfYD+N0AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:40:25.299140Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.13123","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5596429ae8927391b1b956901ac2c1e616461810dad34a0d3038cb868b5d7d62","sha256:5c3d565a423230e03ea0cc7ca5306b13acc5105e938495eb77276b472b173731"],"state_sha256":"3a6742c69352fce58d03d582e95581bd9078d0aa2f00f2547072d6beea2453b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YKPmzlD8+pnUFUQyF4S5giuXk+ciDtsnF4Cnjthuz1tbRGegHMRAf7+pnTNI2VKEqK9KNygt5iv7fgCEbbMnAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T00:17:34.279485Z","bundle_sha256":"64611efa54c31e87d3a41a7e8fc091a6d259571b3e81560959cebfc3c7dde9db"}}