{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:A5VOJWUKA7RFKOMI25C5GJ2MLP","short_pith_number":"pith:A5VOJWUK","schema_version":"1.0","canonical_sha256":"076ae4da8a07e2553988d745d3274c5bf1a5e8cb92581433e47181b2f721df65","source":{"kind":"arxiv","id":"1011.5349","version":1},"attestation_state":"computed","paper":{"title":"Distributed Graph Coloring: An Approach Based on the Calling Behavior of Japanese Tree Frogs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Christian Blum, Hugo Hern\\'andez","submitted_at":"2010-11-24T11:47:59Z","abstract_excerpt":"Graph coloring, also known as vertex coloring, considers the problem of assigning colors to the nodes of a graph such that adjacent nodes do not share the same color. The optimization version of the problem concerns the minimization of the number of used colors. In this paper we deal with the problem of finding valid colorings of graphs in a distributed way, that is, by means of an algorithm that only uses local information for deciding the color of the nodes. Such algorithms prescind from any central control. Due to the fact that quite a few practical applications require to find colorings in"},"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":"1011.5349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-11-24T11:47:59Z","cross_cats_sorted":[],"title_canon_sha256":"e2e5d75c14a4ba4fcd3157b6aa2993527bb3c1ef4e532442b7f459bed4789909","abstract_canon_sha256":"5bc8995114a8f2d928a4e1600a753063f0e652eb60ef3d501ad6fc1292f0bda0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:47.494907Z","signature_b64":"+ta1H/qUGWVL6hZfbmD5XU1pj0CiQGfnh1yyLHkz87Ry5Zr71mzvOiGjpMXv4ki7RB8f+FoNhkw0OqM+SarXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"076ae4da8a07e2553988d745d3274c5bf1a5e8cb92581433e47181b2f721df65","last_reissued_at":"2026-05-18T04:34:47.494436Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:47.494436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Graph Coloring: An Approach Based on the Calling Behavior of Japanese Tree Frogs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Christian Blum, Hugo Hern\\'andez","submitted_at":"2010-11-24T11:47:59Z","abstract_excerpt":"Graph coloring, also known as vertex coloring, considers the problem of assigning colors to the nodes of a graph such that adjacent nodes do not share the same color. The optimization version of the problem concerns the minimization of the number of used colors. In this paper we deal with the problem of finding valid colorings of graphs in a distributed way, that is, by means of an algorithm that only uses local information for deciding the color of the nodes. Such algorithms prescind from any central control. Due to the fact that quite a few practical applications require to find colorings in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5349","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":"1011.5349","created_at":"2026-05-18T04:34:47.494500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.5349v1","created_at":"2026-05-18T04:34:47.494500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5349","created_at":"2026-05-18T04:34:47.494500+00:00"},{"alias_kind":"pith_short_12","alias_value":"A5VOJWUKA7RF","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"A5VOJWUKA7RFKOMI","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"A5VOJWUK","created_at":"2026-05-18T12:26:05.355336+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/A5VOJWUKA7RFKOMI25C5GJ2MLP","json":"https://pith.science/pith/A5VOJWUKA7RFKOMI25C5GJ2MLP.json","graph_json":"https://pith.science/api/pith-number/A5VOJWUKA7RFKOMI25C5GJ2MLP/graph.json","events_json":"https://pith.science/api/pith-number/A5VOJWUKA7RFKOMI25C5GJ2MLP/events.json","paper":"https://pith.science/paper/A5VOJWUK"},"agent_actions":{"view_html":"https://pith.science/pith/A5VOJWUKA7RFKOMI25C5GJ2MLP","download_json":"https://pith.science/pith/A5VOJWUKA7RFKOMI25C5GJ2MLP.json","view_paper":"https://pith.science/paper/A5VOJWUK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.5349&json=true","fetch_graph":"https://pith.science/api/pith-number/A5VOJWUKA7RFKOMI25C5GJ2MLP/graph.json","fetch_events":"https://pith.science/api/pith-number/A5VOJWUKA7RFKOMI25C5GJ2MLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A5VOJWUKA7RFKOMI25C5GJ2MLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A5VOJWUKA7RFKOMI25C5GJ2MLP/action/storage_attestation","attest_author":"https://pith.science/pith/A5VOJWUKA7RFKOMI25C5GJ2MLP/action/author_attestation","sign_citation":"https://pith.science/pith/A5VOJWUKA7RFKOMI25C5GJ2MLP/action/citation_signature","submit_replication":"https://pith.science/pith/A5VOJWUKA7RFKOMI25C5GJ2MLP/action/replication_record"}},"created_at":"2026-05-18T04:34:47.494500+00:00","updated_at":"2026-05-18T04:34:47.494500+00:00"}