{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OVIA47MJLLUILBMG2CS7RH2XBC","short_pith_number":"pith:OVIA47MJ","canonical_record":{"source":{"id":"1903.04598","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-11T20:46:47Z","cross_cats_sorted":["cs.LO","cs.NE","stat.ML"],"title_canon_sha256":"77c144fb26f341e0e3d1e1e1bab2dc8ee1c4d39078c285c9e2db47145d0be41d","abstract_canon_sha256":"d16b7aa4f94cf9911810580808be50c1e0e4c0d7094a887669d6ce04774c1769"},"schema_version":"1.0"},"canonical_sha256":"75500e7d895ae8858586d0a5f89f57088aa370ed265f62e541958e5ef6a8b6bc","source":{"kind":"arxiv","id":"1903.04598","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04598","created_at":"2026-07-05T00:46:30Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04598v2","created_at":"2026-07-05T00:46:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04598","created_at":"2026-07-05T00:46:30Z"},{"alias_kind":"pith_short_12","alias_value":"OVIA47MJLLUI","created_at":"2026-07-05T00:46:30Z"},{"alias_kind":"pith_short_16","alias_value":"OVIA47MJLLUILBMG","created_at":"2026-07-05T00:46:30Z"},{"alias_kind":"pith_short_8","alias_value":"OVIA47MJ","created_at":"2026-07-05T00:46:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OVIA47MJLLUILBMG2CS7RH2XBC","target":"record","payload":{"canonical_record":{"source":{"id":"1903.04598","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-11T20:46:47Z","cross_cats_sorted":["cs.LO","cs.NE","stat.ML"],"title_canon_sha256":"77c144fb26f341e0e3d1e1e1bab2dc8ee1c4d39078c285c9e2db47145d0be41d","abstract_canon_sha256":"d16b7aa4f94cf9911810580808be50c1e0e4c0d7094a887669d6ce04774c1769"},"schema_version":"1.0"},"canonical_sha256":"75500e7d895ae8858586d0a5f89f57088aa370ed265f62e541958e5ef6a8b6bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:46:30.350881Z","signature_b64":"uVcyd9j+iAeq36Uakjf1WjTwy3uL2E76Hdo2y4QRhSB0x9kSX3/gMjhM6KdH4+wI2pLdtF6RNeQ+GKR0lbOtCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75500e7d895ae8858586d0a5f89f57088aa370ed265f62e541958e5ef6a8b6bc","last_reissued_at":"2026-07-05T00:46:30.350385Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:46:30.350385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.04598","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-05T00:46:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"37ttxioj0ImDQDhC5jRvdkqlputAfZQDOJUHtdOow8daymBk47xD9u0pBucwAV4RCGswIKhxjybO9HubCR1pCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T22:31:09.615968Z"},"content_sha256":"2c94a3167d0908dc3305e77d44e519fe631aa2864731582f004ce4df01dc56af","schema_version":"1.0","event_id":"sha256:2c94a3167d0908dc3305e77d44e519fe631aa2864731582f004ce4df01dc56af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OVIA47MJLLUILBMG2CS7RH2XBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Colouring Meets Deep Learning: Effective Graph Neural Network Models for Combinatorial Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Henrique Lemos, Luis Lamb, Marcelo Prates, Pedro Avelar","submitted_at":"2019-03-11T20:46:47Z","abstract_excerpt":"Deep learning has consistently defied state-of-the-art techniques in many fields over the last decade. However, we are just beginning to understand the capabilities of neural learning in symbolic domains. Deep learning architectures that employ parameter sharing over graphs can produce models which can be trained on complex properties of relational data. These include highly relevant NP-Complete problems, such as SAT and TSP. In this work, we showcase how Graph Neural Networks (GNN) can be engineered -- with a very simple architecture -- to solve the fundamental combinatorial problem of graph "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04598","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/1903.04598/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-05T00:46:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mhAnmHIVqsIWDEfivnFlvJw1SOll/4nc+t+8HaRg/4MdZu8zcuu+2vBpM6uvPaQqTXmM+chFqix64eoovstlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T22:31:09.616368Z"},"content_sha256":"7967b0bd252220364547c0f79d483739c2dfd0867ff704764ffc30cffe4cbbd0","schema_version":"1.0","event_id":"sha256:7967b0bd252220364547c0f79d483739c2dfd0867ff704764ffc30cffe4cbbd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OVIA47MJLLUILBMG2CS7RH2XBC/bundle.json","state_url":"https://pith.science/pith/OVIA47MJLLUILBMG2CS7RH2XBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OVIA47MJLLUILBMG2CS7RH2XBC/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-07-06T22:31:09Z","links":{"resolver":"https://pith.science/pith/OVIA47MJLLUILBMG2CS7RH2XBC","bundle":"https://pith.science/pith/OVIA47MJLLUILBMG2CS7RH2XBC/bundle.json","state":"https://pith.science/pith/OVIA47MJLLUILBMG2CS7RH2XBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OVIA47MJLLUILBMG2CS7RH2XBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OVIA47MJLLUILBMG2CS7RH2XBC","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":"d16b7aa4f94cf9911810580808be50c1e0e4c0d7094a887669d6ce04774c1769","cross_cats_sorted":["cs.LO","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-11T20:46:47Z","title_canon_sha256":"77c144fb26f341e0e3d1e1e1bab2dc8ee1c4d39078c285c9e2db47145d0be41d"},"schema_version":"1.0","source":{"id":"1903.04598","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04598","created_at":"2026-07-05T00:46:30Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04598v2","created_at":"2026-07-05T00:46:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04598","created_at":"2026-07-05T00:46:30Z"},{"alias_kind":"pith_short_12","alias_value":"OVIA47MJLLUI","created_at":"2026-07-05T00:46:30Z"},{"alias_kind":"pith_short_16","alias_value":"OVIA47MJLLUILBMG","created_at":"2026-07-05T00:46:30Z"},{"alias_kind":"pith_short_8","alias_value":"OVIA47MJ","created_at":"2026-07-05T00:46:30Z"}],"graph_snapshots":[{"event_id":"sha256:7967b0bd252220364547c0f79d483739c2dfd0867ff704764ffc30cffe4cbbd0","target":"graph","created_at":"2026-07-05T00:46:30Z","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/1903.04598/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Deep learning has consistently defied state-of-the-art techniques in many fields over the last decade. However, we are just beginning to understand the capabilities of neural learning in symbolic domains. Deep learning architectures that employ parameter sharing over graphs can produce models which can be trained on complex properties of relational data. These include highly relevant NP-Complete problems, such as SAT and TSP. In this work, we showcase how Graph Neural Networks (GNN) can be engineered -- with a very simple architecture -- to solve the fundamental combinatorial problem of graph ","authors_text":"Henrique Lemos, Luis Lamb, Marcelo Prates, Pedro Avelar","cross_cats":["cs.LO","cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-11T20:46:47Z","title":"Graph Colouring Meets Deep Learning: Effective Graph Neural Network Models for Combinatorial Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04598","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:2c94a3167d0908dc3305e77d44e519fe631aa2864731582f004ce4df01dc56af","target":"record","created_at":"2026-07-05T00:46:30Z","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":"d16b7aa4f94cf9911810580808be50c1e0e4c0d7094a887669d6ce04774c1769","cross_cats_sorted":["cs.LO","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-11T20:46:47Z","title_canon_sha256":"77c144fb26f341e0e3d1e1e1bab2dc8ee1c4d39078c285c9e2db47145d0be41d"},"schema_version":"1.0","source":{"id":"1903.04598","kind":"arxiv","version":2}},"canonical_sha256":"75500e7d895ae8858586d0a5f89f57088aa370ed265f62e541958e5ef6a8b6bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75500e7d895ae8858586d0a5f89f57088aa370ed265f62e541958e5ef6a8b6bc","first_computed_at":"2026-07-05T00:46:30.350385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:46:30.350385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uVcyd9j+iAeq36Uakjf1WjTwy3uL2E76Hdo2y4QRhSB0x9kSX3/gMjhM6KdH4+wI2pLdtF6RNeQ+GKR0lbOtCg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:46:30.350881Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.04598","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c94a3167d0908dc3305e77d44e519fe631aa2864731582f004ce4df01dc56af","sha256:7967b0bd252220364547c0f79d483739c2dfd0867ff704764ffc30cffe4cbbd0"],"state_sha256":"163a76ab2b4970e4e29bfbe4ee2a3c54e3dc0711e08550cc1a5282535423a01d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sPR676vD7vTambQXSsMDRA7WblG8QYbdb72Ne8UZ9htgWQ0RweyXwl3ZfbBCCKe+0Z8tDVjwKO+QQmblha2pDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T22:31:09.618793Z","bundle_sha256":"a9b95fe096dc620bddccb5c2b72899952f90f2d3e6bafca303bf2333cec7bbb4"}}