{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DXPLJPPOPXYYCLG6IM46LA6VIN","short_pith_number":"pith:DXPLJPPO","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"},"canonical_sha256":"1ddeb4bdee7df1812cde4339e583d5434281d50e6fc84f3e58893155d65e033b","source":{"kind":"arxiv","id":"2402.09124","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.09124","created_at":"2026-07-05T07:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"2402.09124v1","created_at":"2026-07-05T07:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09124","created_at":"2026-07-05T07:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"DXPLJPPOPXYY","created_at":"2026-07-05T07:45:08Z"},{"alias_kind":"pith_short_16","alias_value":"DXPLJPPOPXYYCLG6","created_at":"2026-07-05T07:45:08Z"},{"alias_kind":"pith_short_8","alias_value":"DXPLJPPO","created_at":"2026-07-05T07:45:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DXPLJPPOPXYYCLG6IM46LA6VIN","target":"record","payload":{"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"},"canonical_sha256":"1ddeb4bdee7df1812cde4339e583d5434281d50e6fc84f3e58893155d65e033b","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"},"source_kind":"arxiv","source_id":"2402.09124","source_version":1,"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:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kGjtEb49r7+Kv8UEUEeovVxvQQeH8Y7rtNaGxUiDhEu1v6nt9gAuG+chZ+8OJRmhC+qdYUEYbcBZY29gp5erBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:53:19.381119Z"},"content_sha256":"43681b76fb71409e44740ac3cfe7ddb230b21019221701653803ce23992bc365","schema_version":"1.0","event_id":"sha256:43681b76fb71409e44740ac3cfe7ddb230b21019221701653803ce23992bc365"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DXPLJPPOPXYYCLG6IM46LA6VIN","target":"graph","payload":{"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"},"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:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3P5S4BU7L5pYkp445l6AXj5OtZx5S2iDOReY/X3McjPqyTdfJYAMJ1gTp7eH7h8RBwhcRyAL7kUin6k/f7PYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:53:19.381933Z"},"content_sha256":"8b021a270baeca2972ba6acae71807d42f05b7a1e74f0edb83b2d3fae1804a22","schema_version":"1.0","event_id":"sha256:8b021a270baeca2972ba6acae71807d42f05b7a1e74f0edb83b2d3fae1804a22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXPLJPPOPXYYCLG6IM46LA6VIN/bundle.json","state_url":"https://pith.science/pith/DXPLJPPOPXYYCLG6IM46LA6VIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXPLJPPOPXYYCLG6IM46LA6VIN/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-12T22:53:19Z","links":{"resolver":"https://pith.science/pith/DXPLJPPOPXYYCLG6IM46LA6VIN","bundle":"https://pith.science/pith/DXPLJPPOPXYYCLG6IM46LA6VIN/bundle.json","state":"https://pith.science/pith/DXPLJPPOPXYYCLG6IM46LA6VIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXPLJPPOPXYYCLG6IM46LA6VIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DXPLJPPOPXYYCLG6IM46LA6VIN","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":"fbef3aee55472c8b159497dde62bf379c193b1bf1fcde0062d72046edca87fb1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-02-14T12:22:50Z","title_canon_sha256":"a746c23c8214c8397e67e1d2f70b1ed1a22accf65b58624b6dabe2c4562424a9"},"schema_version":"1.0","source":{"id":"2402.09124","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.09124","created_at":"2026-07-05T07:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"2402.09124v1","created_at":"2026-07-05T07:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09124","created_at":"2026-07-05T07:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"DXPLJPPOPXYY","created_at":"2026-07-05T07:45:08Z"},{"alias_kind":"pith_short_16","alias_value":"DXPLJPPOPXYYCLG6","created_at":"2026-07-05T07:45:08Z"},{"alias_kind":"pith_short_8","alias_value":"DXPLJPPO","created_at":"2026-07-05T07:45:08Z"}],"graph_snapshots":[{"event_id":"sha256:8b021a270baeca2972ba6acae71807d42f05b7a1e74f0edb83b2d3fae1804a22","target":"graph","created_at":"2026-07-05T07:45:08Z","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/2402.09124/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aristides Gionis, Honglian Wang, Lutz Oettershagen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-02-14T12:22:50Z","title":"Finding Densest Subgraphs with Edge-Color Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.09124","kind":"arxiv","version":1},"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:43681b76fb71409e44740ac3cfe7ddb230b21019221701653803ce23992bc365","target":"record","created_at":"2026-07-05T07:45:08Z","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":"fbef3aee55472c8b159497dde62bf379c193b1bf1fcde0062d72046edca87fb1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-02-14T12:22:50Z","title_canon_sha256":"a746c23c8214c8397e67e1d2f70b1ed1a22accf65b58624b6dabe2c4562424a9"},"schema_version":"1.0","source":{"id":"2402.09124","kind":"arxiv","version":1}},"canonical_sha256":"1ddeb4bdee7df1812cde4339e583d5434281d50e6fc84f3e58893155d65e033b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ddeb4bdee7df1812cde4339e583d5434281d50e6fc84f3e58893155d65e033b","first_computed_at":"2026-07-05T07:45:08.938758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:45:08.938758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EhpqQCFWG6zlJzOp4h+MWP64Vhxe7eAITR5FTCGCWFHYId1fgh5NO8Gh3qqWFCfpUqPA/lGLEaRxEf96iDQBDA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:45:08.939156Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.09124","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43681b76fb71409e44740ac3cfe7ddb230b21019221701653803ce23992bc365","sha256:8b021a270baeca2972ba6acae71807d42f05b7a1e74f0edb83b2d3fae1804a22"],"state_sha256":"d25dcfe44a9a9e9a3df01a1a03190a3f7e94d8d4a746b60af178a211ef6c663c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"knTQi4uofgz0Vtx2kIg9V6TSRrBaBjt74MIO+TUHjFctjNG60OKsV672eJKot+mwc63SJ7yAw4SLrs7Y3xxhCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T22:53:19.397799Z","bundle_sha256":"21310aa03203caea16647a57464067380e0b5057ed0ee47e42dcbbaffe4dca9d"}}