{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SRUTABO3WVO24LMDJK7SYS5NZI","short_pith_number":"pith:SRUTABO3","schema_version":"1.0","canonical_sha256":"94693005dbb55dae2d834abf2c4badca3839d9fddbba3d8e7bf8aeb849990f38","source":{"kind":"arxiv","id":"2311.13123","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2311.13123","created_at":"2026-07-05T07:40:25.298761+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.13123v2","created_at":"2026-07-05T07:40:25.298761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.13123","created_at":"2026-07-05T07:40:25.298761+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRUTABO3WVO2","created_at":"2026-07-05T07:40:25.298761+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRUTABO3WVO24LMD","created_at":"2026-07-05T07:40:25.298761+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRUTABO3","created_at":"2026-07-05T07:40:25.298761+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.03223","citing_title":"SI-Agent: An Agentic Framework for Feedback-Driven Generation and Tuning of Human-Readable System Instructions for Large Language Models","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SRUTABO3WVO24LMDJK7SYS5NZI","json":"https://pith.science/pith/SRUTABO3WVO24LMDJK7SYS5NZI.json","graph_json":"https://pith.science/api/pith-number/SRUTABO3WVO24LMDJK7SYS5NZI/graph.json","events_json":"https://pith.science/api/pith-number/SRUTABO3WVO24LMDJK7SYS5NZI/events.json","paper":"https://pith.science/paper/SRUTABO3"},"agent_actions":{"view_html":"https://pith.science/pith/SRUTABO3WVO24LMDJK7SYS5NZI","download_json":"https://pith.science/pith/SRUTABO3WVO24LMDJK7SYS5NZI.json","view_paper":"https://pith.science/paper/SRUTABO3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.13123&json=true","fetch_graph":"https://pith.science/api/pith-number/SRUTABO3WVO24LMDJK7SYS5NZI/graph.json","fetch_events":"https://pith.science/api/pith-number/SRUTABO3WVO24LMDJK7SYS5NZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRUTABO3WVO24LMDJK7SYS5NZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRUTABO3WVO24LMDJK7SYS5NZI/action/storage_attestation","attest_author":"https://pith.science/pith/SRUTABO3WVO24LMDJK7SYS5NZI/action/author_attestation","sign_citation":"https://pith.science/pith/SRUTABO3WVO24LMDJK7SYS5NZI/action/citation_signature","submit_replication":"https://pith.science/pith/SRUTABO3WVO24LMDJK7SYS5NZI/action/replication_record"}},"created_at":"2026-07-05T07:40:25.298761+00:00","updated_at":"2026-07-05T07:40:25.298761+00:00"}