{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RK7IZ6WNLEVZGXJLVISHH7JTMD","short_pith_number":"pith:RK7IZ6WN","schema_version":"1.0","canonical_sha256":"8abe8cfacd592b935d2baa2473fd3360c51007db5cbfbce498a8db151f89c937","source":{"kind":"arxiv","id":"2401.02222","version":2},"attestation_state":"computed","paper":{"title":"Advanced Kernel Search approach for the MST Problem with conflicts involving affinity detection and initial solution construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.OC","authors_text":"Domenico Serra, Francesco Carrabs, Martina Cerulli","submitted_at":"2024-01-04T12:10:39Z","abstract_excerpt":"The Minimum Spanning Tree Problem with Conflicts consists in finding the minimum conflict-free spanning tree of a graph, i.e., the spanning tree of minimum cost, including no pairs of edges that are in conflict. In this paper, we solve this problem using an enhanced Kernel Search method, which iteratively solves refined problem restrictions. Our approach addresses two central open questions in the kernel search literature: (1) how to determine the affinity between variables to ensure that the restricted problem contains variables that are as compatible as possible, meaning they are more likely"},"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":"2401.02222","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-04T12:10:39Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"511567b15a00c26eae561daefad0a2c6ae89c356a709563af0e4135a54a4388e","abstract_canon_sha256":"21dc15584c2d814bd3eb9052ae731721eb64f4e2104f44ae32a39e9caf0a1edf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:57.579928Z","signature_b64":"M++B/E3yxcM33hcfNqWRD4PSZKrAWn5oMw6zzDfiA5y/XPrkfWFKtjJXKH7nrg0Xl3vJKR8eNwXq8pomW7iZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8abe8cfacd592b935d2baa2473fd3360c51007db5cbfbce498a8db151f89c937","last_reissued_at":"2026-07-05T11:18:57.579519Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:57.579519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Advanced Kernel Search approach for the MST Problem with conflicts involving affinity detection and initial solution construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.OC","authors_text":"Domenico Serra, Francesco Carrabs, Martina Cerulli","submitted_at":"2024-01-04T12:10:39Z","abstract_excerpt":"The Minimum Spanning Tree Problem with Conflicts consists in finding the minimum conflict-free spanning tree of a graph, i.e., the spanning tree of minimum cost, including no pairs of edges that are in conflict. In this paper, we solve this problem using an enhanced Kernel Search method, which iteratively solves refined problem restrictions. Our approach addresses two central open questions in the kernel search literature: (1) how to determine the affinity between variables to ensure that the restricted problem contains variables that are as compatible as possible, meaning they are more likely"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.02222","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/2401.02222/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":"2401.02222","created_at":"2026-07-05T11:18:57.579578+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.02222v2","created_at":"2026-07-05T11:18:57.579578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.02222","created_at":"2026-07-05T11:18:57.579578+00:00"},{"alias_kind":"pith_short_12","alias_value":"RK7IZ6WNLEVZ","created_at":"2026-07-05T11:18:57.579578+00:00"},{"alias_kind":"pith_short_16","alias_value":"RK7IZ6WNLEVZGXJL","created_at":"2026-07-05T11:18:57.579578+00:00"},{"alias_kind":"pith_short_8","alias_value":"RK7IZ6WN","created_at":"2026-07-05T11:18:57.579578+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/RK7IZ6WNLEVZGXJLVISHH7JTMD","json":"https://pith.science/pith/RK7IZ6WNLEVZGXJLVISHH7JTMD.json","graph_json":"https://pith.science/api/pith-number/RK7IZ6WNLEVZGXJLVISHH7JTMD/graph.json","events_json":"https://pith.science/api/pith-number/RK7IZ6WNLEVZGXJLVISHH7JTMD/events.json","paper":"https://pith.science/paper/RK7IZ6WN"},"agent_actions":{"view_html":"https://pith.science/pith/RK7IZ6WNLEVZGXJLVISHH7JTMD","download_json":"https://pith.science/pith/RK7IZ6WNLEVZGXJLVISHH7JTMD.json","view_paper":"https://pith.science/paper/RK7IZ6WN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.02222&json=true","fetch_graph":"https://pith.science/api/pith-number/RK7IZ6WNLEVZGXJLVISHH7JTMD/graph.json","fetch_events":"https://pith.science/api/pith-number/RK7IZ6WNLEVZGXJLVISHH7JTMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RK7IZ6WNLEVZGXJLVISHH7JTMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RK7IZ6WNLEVZGXJLVISHH7JTMD/action/storage_attestation","attest_author":"https://pith.science/pith/RK7IZ6WNLEVZGXJLVISHH7JTMD/action/author_attestation","sign_citation":"https://pith.science/pith/RK7IZ6WNLEVZGXJLVISHH7JTMD/action/citation_signature","submit_replication":"https://pith.science/pith/RK7IZ6WNLEVZGXJLVISHH7JTMD/action/replication_record"}},"created_at":"2026-07-05T11:18:57.579578+00:00","updated_at":"2026-07-05T11:18:57.579578+00:00"}