{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FABHWGPO2XMDZIEOJYLPHKVIR5","short_pith_number":"pith:FABHWGPO","canonical_record":{"source":{"id":"1606.04978","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-15T20:54:04Z","cross_cats_sorted":[],"title_canon_sha256":"9e45f84680730c9323cb9533e1b12f9bf511648c5d043fdfbc54aae1e3b4078b","abstract_canon_sha256":"416e99dcbbce6e8009497536f170c7ad1314eda3a49f9923b087580854468ce8"},"schema_version":"1.0"},"canonical_sha256":"28027b19eed5d83ca08e4e16f3aaa88f52bfa1e912af03635f0a27c7b7dd1b64","source":{"kind":"arxiv","id":"1606.04978","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04978","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04978v1","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04978","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"pith_short_12","alias_value":"FABHWGPO2XMD","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FABHWGPO2XMDZIEO","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FABHWGPO","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FABHWGPO2XMDZIEOJYLPHKVIR5","target":"record","payload":{"canonical_record":{"source":{"id":"1606.04978","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-15T20:54:04Z","cross_cats_sorted":[],"title_canon_sha256":"9e45f84680730c9323cb9533e1b12f9bf511648c5d043fdfbc54aae1e3b4078b","abstract_canon_sha256":"416e99dcbbce6e8009497536f170c7ad1314eda3a49f9923b087580854468ce8"},"schema_version":"1.0"},"canonical_sha256":"28027b19eed5d83ca08e4e16f3aaa88f52bfa1e912af03635f0a27c7b7dd1b64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:22.264096Z","signature_b64":"MrpkGyLIdBpkNLrFz39Ie++lzrbMFDC3PV9ccAbYGRKp8Ch+Wm4t6/XnoUwBYijDt5fqwR+TqxpzP7kJgT+CCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28027b19eed5d83ca08e4e16f3aaa88f52bfa1e912af03635f0a27c7b7dd1b64","last_reissued_at":"2026-05-18T01:12:22.263754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:22.263754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.04978","source_version":1,"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-05-18T01:12:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T0gbZ7pZ4YDlqhf9yAoYPL6UO8ejeJVZ+Zeayz3gSAenSEfXL/eVXIdQtX5t2n/VcHb41pY4f4NoAgHlFKZDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T16:45:51.168461Z"},"content_sha256":"415a9dfe1e293481c231ac761ceae7a2334f1138ae4e5e22834653b893585741","schema_version":"1.0","event_id":"sha256:415a9dfe1e293481c231ac761ceae7a2334f1138ae4e5e22834653b893585741"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FABHWGPO2XMDZIEOJYLPHKVIR5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distance geometry approach for special graph coloring problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bruno Dias, Jayme Szwarcfiter, Nelson Maculan, Rosiane de Freitas","submitted_at":"2016-06-15T20:54:04Z","abstract_excerpt":"One of the most important combinatorial optimization problems is graph coloring. There are several variations of this problem involving additional constraints either on vertices or edges. They constitute models for real applications, such as channel assignment in mobile wireless networks. In this work, we consider some coloring problems involving distance constraints as weighted edges, modeling them as distance geometry problems. Thus, the vertices of the graph are considered as embedded on the real line and the coloring is treated as an assignment of positive integers to the vertices, while t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04978","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"},"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-05-18T01:12:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kuFysu4twEuZy8VQ3pVaLQ166GBVaQSTSc9APFZa7fgaTJCCO/FYorKo+dVzbzMJFFCnJZ7PSQ04rXHva8wcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T16:45:51.168811Z"},"content_sha256":"add97dc8b6ce52347598007e970fa142d02f91dd3f47ef59127ce20b1a574155","schema_version":"1.0","event_id":"sha256:add97dc8b6ce52347598007e970fa142d02f91dd3f47ef59127ce20b1a574155"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FABHWGPO2XMDZIEOJYLPHKVIR5/bundle.json","state_url":"https://pith.science/pith/FABHWGPO2XMDZIEOJYLPHKVIR5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FABHWGPO2XMDZIEOJYLPHKVIR5/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-05-20T16:45:51Z","links":{"resolver":"https://pith.science/pith/FABHWGPO2XMDZIEOJYLPHKVIR5","bundle":"https://pith.science/pith/FABHWGPO2XMDZIEOJYLPHKVIR5/bundle.json","state":"https://pith.science/pith/FABHWGPO2XMDZIEOJYLPHKVIR5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FABHWGPO2XMDZIEOJYLPHKVIR5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FABHWGPO2XMDZIEOJYLPHKVIR5","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":"416e99dcbbce6e8009497536f170c7ad1314eda3a49f9923b087580854468ce8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-15T20:54:04Z","title_canon_sha256":"9e45f84680730c9323cb9533e1b12f9bf511648c5d043fdfbc54aae1e3b4078b"},"schema_version":"1.0","source":{"id":"1606.04978","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04978","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04978v1","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04978","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"pith_short_12","alias_value":"FABHWGPO2XMD","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FABHWGPO2XMDZIEO","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FABHWGPO","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:add97dc8b6ce52347598007e970fa142d02f91dd3f47ef59127ce20b1a574155","target":"graph","created_at":"2026-05-18T01:12:22Z","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"},"paper":{"abstract_excerpt":"One of the most important combinatorial optimization problems is graph coloring. There are several variations of this problem involving additional constraints either on vertices or edges. They constitute models for real applications, such as channel assignment in mobile wireless networks. In this work, we consider some coloring problems involving distance constraints as weighted edges, modeling them as distance geometry problems. Thus, the vertices of the graph are considered as embedded on the real line and the coloring is treated as an assignment of positive integers to the vertices, while t","authors_text":"Bruno Dias, Jayme Szwarcfiter, Nelson Maculan, Rosiane de Freitas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-15T20:54:04Z","title":"Distance geometry approach for special graph coloring problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04978","kind":"arxiv","version":1},"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:415a9dfe1e293481c231ac761ceae7a2334f1138ae4e5e22834653b893585741","target":"record","created_at":"2026-05-18T01:12:22Z","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":"416e99dcbbce6e8009497536f170c7ad1314eda3a49f9923b087580854468ce8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-15T20:54:04Z","title_canon_sha256":"9e45f84680730c9323cb9533e1b12f9bf511648c5d043fdfbc54aae1e3b4078b"},"schema_version":"1.0","source":{"id":"1606.04978","kind":"arxiv","version":1}},"canonical_sha256":"28027b19eed5d83ca08e4e16f3aaa88f52bfa1e912af03635f0a27c7b7dd1b64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28027b19eed5d83ca08e4e16f3aaa88f52bfa1e912af03635f0a27c7b7dd1b64","first_computed_at":"2026-05-18T01:12:22.263754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:22.263754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MrpkGyLIdBpkNLrFz39Ie++lzrbMFDC3PV9ccAbYGRKp8Ch+Wm4t6/XnoUwBYijDt5fqwR+TqxpzP7kJgT+CCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:22.264096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.04978","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:415a9dfe1e293481c231ac761ceae7a2334f1138ae4e5e22834653b893585741","sha256:add97dc8b6ce52347598007e970fa142d02f91dd3f47ef59127ce20b1a574155"],"state_sha256":"0264d65f14e62fe3a9d7e331cff4943579ab385c4ee7bfcbd06f743eba3f3203"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9YdhYq5o2BdmX3k4AQjbRyfd019fSHMDZBPcjQKdpZjXdFFH+nIRmbYCRFpZBmIwvo5wo/6J7/RvqrpZvjUkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T16:45:51.170736Z","bundle_sha256":"1ceb0dfa13225e8ab58076aff2d3510881545b8e3c0b713ebf7d9608fccb7c45"}}