{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NWEEJVMB4MUTH7DA2IUTX4MYBQ","short_pith_number":"pith:NWEEJVMB","schema_version":"1.0","canonical_sha256":"6d8844d581e32933fc60d2293bf1980c255a410d71aa9ad077d60871f0bc8959","source":{"kind":"arxiv","id":"1104.4024","version":1},"attestation_state":"computed","paper":{"title":"Palette-colouring: a belief-propagation approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","math.CO"],"primary_cat":"cond-mat.stat-mech","authors_text":"Alessandro Pelizzola, Jort van Mourik, Marco Pretti","submitted_at":"2011-04-20T13:48:32Z","abstract_excerpt":"We consider a variation of the prototype combinatorial-optimisation problem known as graph-colouring. Our optimisation goal is to colour the vertices of a graph with a fixed number of colours, in a way to maximise the number of different colours present in the set of nearest neighbours of each given vertex. This problem, which we pictorially call \"palette-colouring\", has been recently addressed as a basic example of problem arising in the context of distributed data storage. Even though it has not been proved to be NP complete, random search algorithms find the problem hard to solve. Heuristic"},"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":"1104.4024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2011-04-20T13:48:32Z","cross_cats_sorted":["cs.AI","cs.DS","math.CO"],"title_canon_sha256":"468553f74b378db7dba5192672d55ea770ec90c7651917ea44a3f6673c12541d","abstract_canon_sha256":"516218a5c88141337cd9e1b3ed51d59772bd2547bd772ae11847c4428a4e474d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:02:17.477340Z","signature_b64":"8CtZS0k3UiOohejMbh5pCmN8AdWXURLhPVjCMIcku17l7Zlnpl0mTAsnX4Gi87JcCUHxfkg9qk9XDcU/jQnwAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d8844d581e32933fc60d2293bf1980c255a410d71aa9ad077d60871f0bc8959","last_reissued_at":"2026-05-18T02:02:17.476643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:02:17.476643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Palette-colouring: a belief-propagation approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","math.CO"],"primary_cat":"cond-mat.stat-mech","authors_text":"Alessandro Pelizzola, Jort van Mourik, Marco Pretti","submitted_at":"2011-04-20T13:48:32Z","abstract_excerpt":"We consider a variation of the prototype combinatorial-optimisation problem known as graph-colouring. Our optimisation goal is to colour the vertices of a graph with a fixed number of colours, in a way to maximise the number of different colours present in the set of nearest neighbours of each given vertex. This problem, which we pictorially call \"palette-colouring\", has been recently addressed as a basic example of problem arising in the context of distributed data storage. Even though it has not been proved to be NP complete, random search algorithms find the problem hard to solve. Heuristic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4024","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":"1104.4024","created_at":"2026-05-18T02:02:17.476737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.4024v1","created_at":"2026-05-18T02:02:17.476737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4024","created_at":"2026-05-18T02:02:17.476737+00:00"},{"alias_kind":"pith_short_12","alias_value":"NWEEJVMB4MUT","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NWEEJVMB4MUTH7DA","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NWEEJVMB","created_at":"2026-05-18T12:26:37.096874+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/NWEEJVMB4MUTH7DA2IUTX4MYBQ","json":"https://pith.science/pith/NWEEJVMB4MUTH7DA2IUTX4MYBQ.json","graph_json":"https://pith.science/api/pith-number/NWEEJVMB4MUTH7DA2IUTX4MYBQ/graph.json","events_json":"https://pith.science/api/pith-number/NWEEJVMB4MUTH7DA2IUTX4MYBQ/events.json","paper":"https://pith.science/paper/NWEEJVMB"},"agent_actions":{"view_html":"https://pith.science/pith/NWEEJVMB4MUTH7DA2IUTX4MYBQ","download_json":"https://pith.science/pith/NWEEJVMB4MUTH7DA2IUTX4MYBQ.json","view_paper":"https://pith.science/paper/NWEEJVMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.4024&json=true","fetch_graph":"https://pith.science/api/pith-number/NWEEJVMB4MUTH7DA2IUTX4MYBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NWEEJVMB4MUTH7DA2IUTX4MYBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NWEEJVMB4MUTH7DA2IUTX4MYBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NWEEJVMB4MUTH7DA2IUTX4MYBQ/action/storage_attestation","attest_author":"https://pith.science/pith/NWEEJVMB4MUTH7DA2IUTX4MYBQ/action/author_attestation","sign_citation":"https://pith.science/pith/NWEEJVMB4MUTH7DA2IUTX4MYBQ/action/citation_signature","submit_replication":"https://pith.science/pith/NWEEJVMB4MUTH7DA2IUTX4MYBQ/action/replication_record"}},"created_at":"2026-05-18T02:02:17.476737+00:00","updated_at":"2026-05-18T02:02:17.476737+00:00"}