{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:O6L7E33CYGRGJGUVJJQMJRGKAB","short_pith_number":"pith:O6L7E33C","canonical_record":{"source":{"id":"2408.16508","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-29T13:10:48Z","cross_cats_sorted":["cs.CR","cs.SI"],"title_canon_sha256":"684a8b1528e19bf10d78207d318fda644265bfd2f1b7e18e641c24c1a68139c2","abstract_canon_sha256":"b3298f3eca6fd4a7a652602d0ef1ace12c1fb659404e5685c5430cc4af78bcda"},"schema_version":"1.0"},"canonical_sha256":"7797f26f62c1a2649a954a60c4c4ca0079038da6043d00974507948ce451986a","source":{"kind":"arxiv","id":"2408.16508","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.16508","created_at":"2026-07-05T11:19:00Z"},{"alias_kind":"arxiv_version","alias_value":"2408.16508v2","created_at":"2026-07-05T11:19:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.16508","created_at":"2026-07-05T11:19:00Z"},{"alias_kind":"pith_short_12","alias_value":"O6L7E33CYGRG","created_at":"2026-07-05T11:19:00Z"},{"alias_kind":"pith_short_16","alias_value":"O6L7E33CYGRGJGUV","created_at":"2026-07-05T11:19:00Z"},{"alias_kind":"pith_short_8","alias_value":"O6L7E33C","created_at":"2026-07-05T11:19:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:O6L7E33CYGRGJGUVJJQMJRGKAB","target":"record","payload":{"canonical_record":{"source":{"id":"2408.16508","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-29T13:10:48Z","cross_cats_sorted":["cs.CR","cs.SI"],"title_canon_sha256":"684a8b1528e19bf10d78207d318fda644265bfd2f1b7e18e641c24c1a68139c2","abstract_canon_sha256":"b3298f3eca6fd4a7a652602d0ef1ace12c1fb659404e5685c5430cc4af78bcda"},"schema_version":"1.0"},"canonical_sha256":"7797f26f62c1a2649a954a60c4c4ca0079038da6043d00974507948ce451986a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:00.319647Z","signature_b64":"Mka0TVB72NINC1hAG/Fw7+2GJyvTYiOCtDr+phaPPGBRRjp6yqO1rGW4Tvd4ffiFB+fsT7DTfwvx0/7SNp4uDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7797f26f62c1a2649a954a60c4c4ca0079038da6043d00974507948ce451986a","last_reissued_at":"2026-07-05T11:19:00.319152Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:00.319152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.16508","source_version":2,"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-05T11:19:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pct3vOwyktSrVQI/bHnUW7O3iviq1sWNtdYDNMFEkNBxOFw4/f8G6LLB70wQpXXVDp7m2O6lh2a9+uNGdI2nCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T23:11:30.576807Z"},"content_sha256":"e70f3e76fa2198cca0d8fad3f923bd7065cb4d44230cc9c11f7316a8a09d6b26","schema_version":"1.0","event_id":"sha256:e70f3e76fa2198cca0d8fad3f923bd7065cb4d44230cc9c11f7316a8a09d6b26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:O6L7E33CYGRGJGUVJJQMJRGKAB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Branch-and-cut algorithms for colorful components problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.SI"],"primary_cat":"math.CO","authors_text":"Carmine Sorgente, Claudia Archetti, Martina Cerulli","submitted_at":"2024-08-29T13:10:48Z","abstract_excerpt":"We tackle three optimization problems in which a colored graph, where each node is assigned a color, must be partitioned into colorful connected components. A component is defined as colorful if each color appears at most once. The problems differ in the objective function, which determines which partition is the best one. These problems have applications in community detection, cybersecurity, and bioinformatics. We present integer non-linear formulations, which are then linearized using standard techniques. To solve these formulations, we develop exact branch-and-cut algorithms, embedding var"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.16508","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/2408.16508/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-05T11:19:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u19VkRgcpKixzL+Xtno9FfNbBrgKbnPvcSHaNfx1eN3yrFj8TMx1ospQldAOs8Ep6nVIw6Y4M3JuhkWcpckdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T23:11:30.577325Z"},"content_sha256":"eed75569194878ee4e59cdfcdc75e5d0c02c5e805f27ba98ab2b50c57279b88e","schema_version":"1.0","event_id":"sha256:eed75569194878ee4e59cdfcdc75e5d0c02c5e805f27ba98ab2b50c57279b88e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6L7E33CYGRGJGUVJJQMJRGKAB/bundle.json","state_url":"https://pith.science/pith/O6L7E33CYGRGJGUVJJQMJRGKAB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6L7E33CYGRGJGUVJJQMJRGKAB/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-20T23:11:30Z","links":{"resolver":"https://pith.science/pith/O6L7E33CYGRGJGUVJJQMJRGKAB","bundle":"https://pith.science/pith/O6L7E33CYGRGJGUVJJQMJRGKAB/bundle.json","state":"https://pith.science/pith/O6L7E33CYGRGJGUVJJQMJRGKAB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6L7E33CYGRGJGUVJJQMJRGKAB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:O6L7E33CYGRGJGUVJJQMJRGKAB","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":"b3298f3eca6fd4a7a652602d0ef1ace12c1fb659404e5685c5430cc4af78bcda","cross_cats_sorted":["cs.CR","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-29T13:10:48Z","title_canon_sha256":"684a8b1528e19bf10d78207d318fda644265bfd2f1b7e18e641c24c1a68139c2"},"schema_version":"1.0","source":{"id":"2408.16508","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.16508","created_at":"2026-07-05T11:19:00Z"},{"alias_kind":"arxiv_version","alias_value":"2408.16508v2","created_at":"2026-07-05T11:19:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.16508","created_at":"2026-07-05T11:19:00Z"},{"alias_kind":"pith_short_12","alias_value":"O6L7E33CYGRG","created_at":"2026-07-05T11:19:00Z"},{"alias_kind":"pith_short_16","alias_value":"O6L7E33CYGRGJGUV","created_at":"2026-07-05T11:19:00Z"},{"alias_kind":"pith_short_8","alias_value":"O6L7E33C","created_at":"2026-07-05T11:19:00Z"}],"graph_snapshots":[{"event_id":"sha256:eed75569194878ee4e59cdfcdc75e5d0c02c5e805f27ba98ab2b50c57279b88e","target":"graph","created_at":"2026-07-05T11:19:00Z","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/2408.16508/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We tackle three optimization problems in which a colored graph, where each node is assigned a color, must be partitioned into colorful connected components. A component is defined as colorful if each color appears at most once. The problems differ in the objective function, which determines which partition is the best one. These problems have applications in community detection, cybersecurity, and bioinformatics. We present integer non-linear formulations, which are then linearized using standard techniques. To solve these formulations, we develop exact branch-and-cut algorithms, embedding var","authors_text":"Carmine Sorgente, Claudia Archetti, Martina Cerulli","cross_cats":["cs.CR","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-29T13:10:48Z","title":"Branch-and-cut algorithms for colorful components problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.16508","kind":"arxiv","version":2},"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:e70f3e76fa2198cca0d8fad3f923bd7065cb4d44230cc9c11f7316a8a09d6b26","target":"record","created_at":"2026-07-05T11:19:00Z","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":"b3298f3eca6fd4a7a652602d0ef1ace12c1fb659404e5685c5430cc4af78bcda","cross_cats_sorted":["cs.CR","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-29T13:10:48Z","title_canon_sha256":"684a8b1528e19bf10d78207d318fda644265bfd2f1b7e18e641c24c1a68139c2"},"schema_version":"1.0","source":{"id":"2408.16508","kind":"arxiv","version":2}},"canonical_sha256":"7797f26f62c1a2649a954a60c4c4ca0079038da6043d00974507948ce451986a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7797f26f62c1a2649a954a60c4c4ca0079038da6043d00974507948ce451986a","first_computed_at":"2026-07-05T11:19:00.319152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:19:00.319152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mka0TVB72NINC1hAG/Fw7+2GJyvTYiOCtDr+phaPPGBRRjp6yqO1rGW4Tvd4ffiFB+fsT7DTfwvx0/7SNp4uDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:19:00.319647Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.16508","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e70f3e76fa2198cca0d8fad3f923bd7065cb4d44230cc9c11f7316a8a09d6b26","sha256:eed75569194878ee4e59cdfcdc75e5d0c02c5e805f27ba98ab2b50c57279b88e"],"state_sha256":"2014d2ff710f0099256bf30c73c95a91deb6deaebea251e2d76af4daede20468"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xH57miP5E/RK2IAYLv6gFlPkVxg2Q2WNYl4RX4Z+we2UIfSYdb7Fi/2rRRJi77DIFGX7RAJP+tW7hbIIR9dtDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T23:11:30.582112Z","bundle_sha256":"86428bf4102f7ce2a64c803eca67762ffcf1d361f2c8d75bb81eddff8d2caa18"}}