{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XJCIQ5SFSUU7PPGLQPQH646KAO","short_pith_number":"pith:XJCIQ5SF","schema_version":"1.0","canonical_sha256":"ba448876459529f7bccb83e07f73ca03aba985ca2516965d3a33a038d245a9c6","source":{"kind":"arxiv","id":"1210.5176","version":1},"attestation_state":"computed","paper":{"title":"A simple and fast heuristic algorithm for edge-coloring of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"J. Vilaltella, M.A. Fiol","submitted_at":"2012-10-18T16:29:50Z","abstract_excerpt":"A simple but empirically efficient heuristic algorithm for the edge-coloring of graphs is presented. Its basic idea is the displacement of \"conflicts\" (repeated colors in the edges incident to a vertex) along paths of adjacent vertices whose incident edges are recolored by swapping alternating colors (that is, doing a Kempe interchange). The results of performance tests on random cubic and $\\Delta$-regular graphs are presented, and a full implementation of the algorithm is given to facilitate its use and the reproducibility of results."},"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":"1210.5176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-18T16:29:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e54d074552711a1d80f58fdc849d18ca8e427a856eb16b215e91db054cc1e972","abstract_canon_sha256":"02d9d6f5f0e29519f7e7299115b45c42280d087b0c4f3308cfff3568aaf4eba7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:53.695560Z","signature_b64":"ZS4j1V7INwIMvU2H07g45QVFD1J7ansAlln38yccOXANZ2DBTgRPCGul0gA02KjcsnonVbbCaw16noUTxi1mAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba448876459529f7bccb83e07f73ca03aba985ca2516965d3a33a038d245a9c6","last_reissued_at":"2026-05-18T03:42:53.695036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:53.695036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simple and fast heuristic algorithm for edge-coloring of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"J. Vilaltella, M.A. Fiol","submitted_at":"2012-10-18T16:29:50Z","abstract_excerpt":"A simple but empirically efficient heuristic algorithm for the edge-coloring of graphs is presented. Its basic idea is the displacement of \"conflicts\" (repeated colors in the edges incident to a vertex) along paths of adjacent vertices whose incident edges are recolored by swapping alternating colors (that is, doing a Kempe interchange). The results of performance tests on random cubic and $\\Delta$-regular graphs are presented, and a full implementation of the algorithm is given to facilitate its use and the reproducibility of results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5176","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":"1210.5176","created_at":"2026-05-18T03:42:53.695117+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.5176v1","created_at":"2026-05-18T03:42:53.695117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5176","created_at":"2026-05-18T03:42:53.695117+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJCIQ5SFSUU7","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJCIQ5SFSUU7PPGL","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJCIQ5SF","created_at":"2026-05-18T12:27:27.928770+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/XJCIQ5SFSUU7PPGLQPQH646KAO","json":"https://pith.science/pith/XJCIQ5SFSUU7PPGLQPQH646KAO.json","graph_json":"https://pith.science/api/pith-number/XJCIQ5SFSUU7PPGLQPQH646KAO/graph.json","events_json":"https://pith.science/api/pith-number/XJCIQ5SFSUU7PPGLQPQH646KAO/events.json","paper":"https://pith.science/paper/XJCIQ5SF"},"agent_actions":{"view_html":"https://pith.science/pith/XJCIQ5SFSUU7PPGLQPQH646KAO","download_json":"https://pith.science/pith/XJCIQ5SFSUU7PPGLQPQH646KAO.json","view_paper":"https://pith.science/paper/XJCIQ5SF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.5176&json=true","fetch_graph":"https://pith.science/api/pith-number/XJCIQ5SFSUU7PPGLQPQH646KAO/graph.json","fetch_events":"https://pith.science/api/pith-number/XJCIQ5SFSUU7PPGLQPQH646KAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJCIQ5SFSUU7PPGLQPQH646KAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJCIQ5SFSUU7PPGLQPQH646KAO/action/storage_attestation","attest_author":"https://pith.science/pith/XJCIQ5SFSUU7PPGLQPQH646KAO/action/author_attestation","sign_citation":"https://pith.science/pith/XJCIQ5SFSUU7PPGLQPQH646KAO/action/citation_signature","submit_replication":"https://pith.science/pith/XJCIQ5SFSUU7PPGLQPQH646KAO/action/replication_record"}},"created_at":"2026-05-18T03:42:53.695117+00:00","updated_at":"2026-05-18T03:42:53.695117+00:00"}