{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TFIKWKCEHPRKYYHABYS2E7GUEQ","short_pith_number":"pith:TFIKWKCE","schema_version":"1.0","canonical_sha256":"9950ab28443be2ac60e00e25a27cd42422bc0991b95b8412ac54f3d1f4da71f6","source":{"kind":"arxiv","id":"2307.15969","version":4},"attestation_state":"computed","paper":{"title":"Fast Searching The Densest Subgraph And Decomposition With Local Optimality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Shenghua Liu, Wenjie Feng, Xueqi Cheng, Yugao Zhu","submitted_at":"2023-07-29T12:20:49Z","abstract_excerpt":"Densest Subgraph Problem (DSP) is an important primitive problem with a wide range of applications, including fraud detection, community detection and DNA motif discovery. Edge-based density is one of the most common metrics in DSP. Although a maximum flow algorithm can exactly solve it in polynomial time, the increasing amount of data and the high complexity of algorithms motivate scientists to find approximation algorithms. Among these, its duality of linear programming derives several iterative algorithms including Greedy++, Frank-Wolfe and FISTA which redistribute edge weights to find 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":"2307.15969","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-07-29T12:20:49Z","cross_cats_sorted":[],"title_canon_sha256":"efd8e087bf63d17f08132331ad1058906f975a03618db8da4e4013dc156dace0","abstract_canon_sha256":"76602e174bd640454e0772021314b29af67b7c5bc0c8998578057e8afcb354cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:06:32.613374Z","signature_b64":"hrYi9B56LQqUhvPysPnmCrD9V//uD7wLTRIjZK4aQeqdpTL/zo0e1wSRDvqXEN7c4PXPGd8144o0sYTqZxxcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9950ab28443be2ac60e00e25a27cd42422bc0991b95b8412ac54f3d1f4da71f6","last_reissued_at":"2026-07-05T07:06:32.612878Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:06:32.612878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Searching The Densest Subgraph And Decomposition With Local Optimality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Shenghua Liu, Wenjie Feng, Xueqi Cheng, Yugao Zhu","submitted_at":"2023-07-29T12:20:49Z","abstract_excerpt":"Densest Subgraph Problem (DSP) is an important primitive problem with a wide range of applications, including fraud detection, community detection and DNA motif discovery. Edge-based density is one of the most common metrics in DSP. Although a maximum flow algorithm can exactly solve it in polynomial time, the increasing amount of data and the high complexity of algorithms motivate scientists to find approximation algorithms. Among these, its duality of linear programming derives several iterative algorithms including Greedy++, Frank-Wolfe and FISTA which redistribute edge weights to find the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.15969","kind":"arxiv","version":4},"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/2307.15969/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":"2307.15969","created_at":"2026-07-05T07:06:32.612935+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.15969v4","created_at":"2026-07-05T07:06:32.612935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.15969","created_at":"2026-07-05T07:06:32.612935+00:00"},{"alias_kind":"pith_short_12","alias_value":"TFIKWKCEHPRK","created_at":"2026-07-05T07:06:32.612935+00:00"},{"alias_kind":"pith_short_16","alias_value":"TFIKWKCEHPRKYYHA","created_at":"2026-07-05T07:06:32.612935+00:00"},{"alias_kind":"pith_short_8","alias_value":"TFIKWKCE","created_at":"2026-07-05T07:06:32.612935+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18131","citing_title":"ComPart: Community-Guided Post-Coarsening for High-Quality Hypergraph Partitioning","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TFIKWKCEHPRKYYHABYS2E7GUEQ","json":"https://pith.science/pith/TFIKWKCEHPRKYYHABYS2E7GUEQ.json","graph_json":"https://pith.science/api/pith-number/TFIKWKCEHPRKYYHABYS2E7GUEQ/graph.json","events_json":"https://pith.science/api/pith-number/TFIKWKCEHPRKYYHABYS2E7GUEQ/events.json","paper":"https://pith.science/paper/TFIKWKCE"},"agent_actions":{"view_html":"https://pith.science/pith/TFIKWKCEHPRKYYHABYS2E7GUEQ","download_json":"https://pith.science/pith/TFIKWKCEHPRKYYHABYS2E7GUEQ.json","view_paper":"https://pith.science/paper/TFIKWKCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.15969&json=true","fetch_graph":"https://pith.science/api/pith-number/TFIKWKCEHPRKYYHABYS2E7GUEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/TFIKWKCEHPRKYYHABYS2E7GUEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TFIKWKCEHPRKYYHABYS2E7GUEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TFIKWKCEHPRKYYHABYS2E7GUEQ/action/storage_attestation","attest_author":"https://pith.science/pith/TFIKWKCEHPRKYYHABYS2E7GUEQ/action/author_attestation","sign_citation":"https://pith.science/pith/TFIKWKCEHPRKYYHABYS2E7GUEQ/action/citation_signature","submit_replication":"https://pith.science/pith/TFIKWKCEHPRKYYHABYS2E7GUEQ/action/replication_record"}},"created_at":"2026-07-05T07:06:32.612935+00:00","updated_at":"2026-07-05T07:06:32.612935+00:00"}