{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DXPLJPPOPXYYCLG6IM46LA6VIN","short_pith_number":"pith:DXPLJPPO","schema_version":"1.0","canonical_sha256":"1ddeb4bdee7df1812cde4339e583d5434281d50e6fc84f3e58893155d65e033b","source":{"kind":"arxiv","id":"2402.09124","version":1},"attestation_state":"computed","paper":{"title":"Finding Densest Subgraphs with Edge-Color Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Aristides Gionis, Honglian Wang, Lutz Oettershagen","submitted_at":"2024-02-14T12:22:50Z","abstract_excerpt":"We consider a variant of the densest subgraph problem in networks with single or multiple edge attributes. For example, in a social network, the edge attributes may describe the type of relationship between users, such as friends, family, or acquaintances, or different types of communication. For conceptual simplicity, we view the attributes as edge colors. The new problem we address is to find a diverse densest subgraph that fulfills given requirements on the numbers of edges of specific colors. When searching for a dense social network community, our problem will enforce the requirement that"},"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":"2402.09124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-02-14T12:22:50Z","cross_cats_sorted":[],"title_canon_sha256":"a746c23c8214c8397e67e1d2f70b1ed1a22accf65b58624b6dabe2c4562424a9","abstract_canon_sha256":"fbef3aee55472c8b159497dde62bf379c193b1bf1fcde0062d72046edca87fb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:45:08.939156Z","signature_b64":"EhpqQCFWG6zlJzOp4h+MWP64Vhxe7eAITR5FTCGCWFHYId1fgh5NO8Gh3qqWFCfpUqPA/lGLEaRxEf96iDQBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ddeb4bdee7df1812cde4339e583d5434281d50e6fc84f3e58893155d65e033b","last_reissued_at":"2026-07-05T07:45:08.938758Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:45:08.938758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Densest Subgraphs with Edge-Color Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Aristides Gionis, Honglian Wang, Lutz Oettershagen","submitted_at":"2024-02-14T12:22:50Z","abstract_excerpt":"We consider a variant of the densest subgraph problem in networks with single or multiple edge attributes. For example, in a social network, the edge attributes may describe the type of relationship between users, such as friends, family, or acquaintances, or different types of communication. For conceptual simplicity, we view the attributes as edge colors. The new problem we address is to find a diverse densest subgraph that fulfills given requirements on the numbers of edges of specific colors. When searching for a dense social network community, our problem will enforce the requirement that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.09124","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.09124/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":"2402.09124","created_at":"2026-07-05T07:45:08.938822+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.09124v1","created_at":"2026-07-05T07:45:08.938822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09124","created_at":"2026-07-05T07:45:08.938822+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXPLJPPOPXYY","created_at":"2026-07-05T07:45:08.938822+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXPLJPPOPXYYCLG6","created_at":"2026-07-05T07:45:08.938822+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXPLJPPO","created_at":"2026-07-05T07:45:08.938822+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.01381","citing_title":"Fair densest subgraph across multiple graphs","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DXPLJPPOPXYYCLG6IM46LA6VIN","json":"https://pith.science/pith/DXPLJPPOPXYYCLG6IM46LA6VIN.json","graph_json":"https://pith.science/api/pith-number/DXPLJPPOPXYYCLG6IM46LA6VIN/graph.json","events_json":"https://pith.science/api/pith-number/DXPLJPPOPXYYCLG6IM46LA6VIN/events.json","paper":"https://pith.science/paper/DXPLJPPO"},"agent_actions":{"view_html":"https://pith.science/pith/DXPLJPPOPXYYCLG6IM46LA6VIN","download_json":"https://pith.science/pith/DXPLJPPOPXYYCLG6IM46LA6VIN.json","view_paper":"https://pith.science/paper/DXPLJPPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.09124&json=true","fetch_graph":"https://pith.science/api/pith-number/DXPLJPPOPXYYCLG6IM46LA6VIN/graph.json","fetch_events":"https://pith.science/api/pith-number/DXPLJPPOPXYYCLG6IM46LA6VIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXPLJPPOPXYYCLG6IM46LA6VIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXPLJPPOPXYYCLG6IM46LA6VIN/action/storage_attestation","attest_author":"https://pith.science/pith/DXPLJPPOPXYYCLG6IM46LA6VIN/action/author_attestation","sign_citation":"https://pith.science/pith/DXPLJPPOPXYYCLG6IM46LA6VIN/action/citation_signature","submit_replication":"https://pith.science/pith/DXPLJPPOPXYYCLG6IM46LA6VIN/action/replication_record"}},"created_at":"2026-07-05T07:45:08.938822+00:00","updated_at":"2026-07-05T07:45:08.938822+00:00"}