{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GGZFOW2TTQ42PP5CL4XB35Y77Q","short_pith_number":"pith:GGZFOW2T","schema_version":"1.0","canonical_sha256":"31b2575b539c39a7bfa25f2e1df71ffc137cc1f1afb574c5887d8b488ef312d7","source":{"kind":"arxiv","id":"1904.08178","version":1},"attestation_state":"computed","paper":{"title":"Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Charalampos E. Tsourakakis, Jakub Pachocki, Naonori Kakimura, Tianyi Chen","submitted_at":"2019-04-17T10:51:09Z","abstract_excerpt":"In the densest subgraph problem, given a weighted undirected graph $G(V,E,w)$, with non-negative edge weights, we are asked to find a subset of nodes $S\\subseteq V$ that maximizes the degree density $w(S)/|S|$, where $w(S)$ is the sum of the edge weights induced by $S$. This problem is a well studied problem, known as the {\\em densest subgraph problem}, and is solvable in polynomial time. But what happens when the edge weights are negative? Is the problem still solvable in polynomial time? Also, why should we care about the densest subgraph problem in the presence of negative weights?\n  In thi"},"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":"1904.08178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-04-17T10:51:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bee906d96a8c7db6bb925020c2edd55b9b7ef58ec5bb2f93579fe82e0c8618fb","abstract_canon_sha256":"fa32e6a8e00b3bea02abba801a39619f2e427002ca7a6aaba9913d244d8124a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:18.509236Z","signature_b64":"037DfPOBHC+P+h2KSsWfz4WkPMm8PT3/4FA/ZmOBmeJSkjiLTbYgLYsxx4+g3l9blox+BjEr5+e2klUFILksDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31b2575b539c39a7bfa25f2e1df71ffc137cc1f1afb574c5887d8b488ef312d7","last_reissued_at":"2026-05-17T23:48:18.508530Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:18.508530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Charalampos E. Tsourakakis, Jakub Pachocki, Naonori Kakimura, Tianyi Chen","submitted_at":"2019-04-17T10:51:09Z","abstract_excerpt":"In the densest subgraph problem, given a weighted undirected graph $G(V,E,w)$, with non-negative edge weights, we are asked to find a subset of nodes $S\\subseteq V$ that maximizes the degree density $w(S)/|S|$, where $w(S)$ is the sum of the edge weights induced by $S$. This problem is a well studied problem, known as the {\\em densest subgraph problem}, and is solvable in polynomial time. But what happens when the edge weights are negative? Is the problem still solvable in polynomial time? Also, why should we care about the densest subgraph problem in the presence of negative weights?\n  In thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08178","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":""},"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":"1904.08178","created_at":"2026-05-17T23:48:18.508659+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.08178v1","created_at":"2026-05-17T23:48:18.508659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08178","created_at":"2026-05-17T23:48:18.508659+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGZFOW2TTQ42","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGZFOW2TTQ42PP5C","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGZFOW2T","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GGZFOW2TTQ42PP5CL4XB35Y77Q","json":"https://pith.science/pith/GGZFOW2TTQ42PP5CL4XB35Y77Q.json","graph_json":"https://pith.science/api/pith-number/GGZFOW2TTQ42PP5CL4XB35Y77Q/graph.json","events_json":"https://pith.science/api/pith-number/GGZFOW2TTQ42PP5CL4XB35Y77Q/events.json","paper":"https://pith.science/paper/GGZFOW2T"},"agent_actions":{"view_html":"https://pith.science/pith/GGZFOW2TTQ42PP5CL4XB35Y77Q","download_json":"https://pith.science/pith/GGZFOW2TTQ42PP5CL4XB35Y77Q.json","view_paper":"https://pith.science/paper/GGZFOW2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.08178&json=true","fetch_graph":"https://pith.science/api/pith-number/GGZFOW2TTQ42PP5CL4XB35Y77Q/graph.json","fetch_events":"https://pith.science/api/pith-number/GGZFOW2TTQ42PP5CL4XB35Y77Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGZFOW2TTQ42PP5CL4XB35Y77Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGZFOW2TTQ42PP5CL4XB35Y77Q/action/storage_attestation","attest_author":"https://pith.science/pith/GGZFOW2TTQ42PP5CL4XB35Y77Q/action/author_attestation","sign_citation":"https://pith.science/pith/GGZFOW2TTQ42PP5CL4XB35Y77Q/action/citation_signature","submit_replication":"https://pith.science/pith/GGZFOW2TTQ42PP5CL4XB35Y77Q/action/replication_record"}},"created_at":"2026-05-17T23:48:18.508659+00:00","updated_at":"2026-05-17T23:48:18.508659+00:00"}