{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:77WEOX6FWCWLVACFK3P5OIDYZV","short_pith_number":"pith:77WEOX6F","canonical_record":{"source":{"id":"1808.01022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-02T20:56:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ec10a50962eb44bf1a83e865f8034557ae1a6cb2c598e0fcfe9fef9119c8100c","abstract_canon_sha256":"79488ce71f89e5276a5f1a976bd1bed7175cce95b2b5d8e661ea344f0d146279"},"schema_version":"1.0"},"canonical_sha256":"ffec475fc5b0acba804556dfd72078cd53fd3f1a99cc57b4dcf271a9072b0e1f","source":{"kind":"arxiv","id":"1808.01022","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01022","created_at":"2026-05-18T00:08:59Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01022v1","created_at":"2026-05-18T00:08:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01022","created_at":"2026-05-18T00:08:59Z"},{"alias_kind":"pith_short_12","alias_value":"77WEOX6FWCWL","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"77WEOX6FWCWLVACF","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"77WEOX6F","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:77WEOX6FWCWLVACFK3P5OIDYZV","target":"record","payload":{"canonical_record":{"source":{"id":"1808.01022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-02T20:56:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ec10a50962eb44bf1a83e865f8034557ae1a6cb2c598e0fcfe9fef9119c8100c","abstract_canon_sha256":"79488ce71f89e5276a5f1a976bd1bed7175cce95b2b5d8e661ea344f0d146279"},"schema_version":"1.0"},"canonical_sha256":"ffec475fc5b0acba804556dfd72078cd53fd3f1a99cc57b4dcf271a9072b0e1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:59.320024Z","signature_b64":"NGHVLHqVgwGc96D9TvDGUeqfzTFKWk4JOJyiplT4AXJxYS71Au3MSqB2vUoPqoUDXc2ZiKKMrtE0eF9urTlLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffec475fc5b0acba804556dfd72078cd53fd3f1a99cc57b4dcf271a9072b0e1f","last_reissued_at":"2026-05-18T00:08:59.319513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:59.319513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.01022","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-18T00:08:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vv6pIBTK+xjDgo2JL5dsUPIdfax2Un6arxbosUyDE5BYsVWyWhGs1JtCgkXQh389QyPyitrDr1FEfPfO/eGZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:17:28.023928Z"},"content_sha256":"314459a4ff402aebd5abfd4d8574e6cab77ba70a0333785405ee0d19ed3f3c70","schema_version":"1.0","event_id":"sha256:314459a4ff402aebd5abfd4d8574e6cab77ba70a0333785405ee0d19ed3f3c70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:77WEOX6FWCWLVACFK3P5OIDYZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"F.J. Arag\\'on Artacho, R. Campoy, V. Elser","submitted_at":"2018-08-02T20:56:46Z","abstract_excerpt":"We study the behavior of the Douglas-Rachford algorithm on the graph vertex-coloring problem. Given a graph and a number of colors, the goal is to find a coloring of the vertices so that all adjacent vertex pairs have different colors. In spite of the combinatorial nature of this problem, the Douglas-Rachford algorithm was recently shown to be a successful heuristic for solving a wide variety of graph coloring instances, when the problem was cast as a feasibility problem on binary indicator variables. In this work we consider a different formulation, based on semidefinite programming. The much"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01022","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-18T00:08:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VLFUVhXog/5OmGeVnq0vDk2FnyMM0SyElOq8fdM8ux5oLpRVYLA9ilfrSERZwlnLFmf5atPgmbbLp+gLsYgVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:17:28.024277Z"},"content_sha256":"5382cfe890113ead495e501caa24d45d1053e354b6f7faf778e65dd6d2718a5e","schema_version":"1.0","event_id":"sha256:5382cfe890113ead495e501caa24d45d1053e354b6f7faf778e65dd6d2718a5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/77WEOX6FWCWLVACFK3P5OIDYZV/bundle.json","state_url":"https://pith.science/pith/77WEOX6FWCWLVACFK3P5OIDYZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/77WEOX6FWCWLVACFK3P5OIDYZV/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-06-02T04:17:28Z","links":{"resolver":"https://pith.science/pith/77WEOX6FWCWLVACFK3P5OIDYZV","bundle":"https://pith.science/pith/77WEOX6FWCWLVACFK3P5OIDYZV/bundle.json","state":"https://pith.science/pith/77WEOX6FWCWLVACFK3P5OIDYZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/77WEOX6FWCWLVACFK3P5OIDYZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:77WEOX6FWCWLVACFK3P5OIDYZV","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":"79488ce71f89e5276a5f1a976bd1bed7175cce95b2b5d8e661ea344f0d146279","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-02T20:56:46Z","title_canon_sha256":"ec10a50962eb44bf1a83e865f8034557ae1a6cb2c598e0fcfe9fef9119c8100c"},"schema_version":"1.0","source":{"id":"1808.01022","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01022","created_at":"2026-05-18T00:08:59Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01022v1","created_at":"2026-05-18T00:08:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01022","created_at":"2026-05-18T00:08:59Z"},{"alias_kind":"pith_short_12","alias_value":"77WEOX6FWCWL","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"77WEOX6FWCWLVACF","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"77WEOX6F","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:5382cfe890113ead495e501caa24d45d1053e354b6f7faf778e65dd6d2718a5e","target":"graph","created_at":"2026-05-18T00:08:59Z","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":"We study the behavior of the Douglas-Rachford algorithm on the graph vertex-coloring problem. Given a graph and a number of colors, the goal is to find a coloring of the vertices so that all adjacent vertex pairs have different colors. In spite of the combinatorial nature of this problem, the Douglas-Rachford algorithm was recently shown to be a successful heuristic for solving a wide variety of graph coloring instances, when the problem was cast as a feasibility problem on binary indicator variables. In this work we consider a different formulation, based on semidefinite programming. The much","authors_text":"F.J. Arag\\'on Artacho, R. Campoy, V. Elser","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-02T20:56:46Z","title":"An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01022","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:314459a4ff402aebd5abfd4d8574e6cab77ba70a0333785405ee0d19ed3f3c70","target":"record","created_at":"2026-05-18T00:08:59Z","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":"79488ce71f89e5276a5f1a976bd1bed7175cce95b2b5d8e661ea344f0d146279","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-02T20:56:46Z","title_canon_sha256":"ec10a50962eb44bf1a83e865f8034557ae1a6cb2c598e0fcfe9fef9119c8100c"},"schema_version":"1.0","source":{"id":"1808.01022","kind":"arxiv","version":1}},"canonical_sha256":"ffec475fc5b0acba804556dfd72078cd53fd3f1a99cc57b4dcf271a9072b0e1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffec475fc5b0acba804556dfd72078cd53fd3f1a99cc57b4dcf271a9072b0e1f","first_computed_at":"2026-05-18T00:08:59.319513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:59.319513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NGHVLHqVgwGc96D9TvDGUeqfzTFKWk4JOJyiplT4AXJxYS71Au3MSqB2vUoPqoUDXc2ZiKKMrtE0eF9urTlLAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:59.320024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.01022","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:314459a4ff402aebd5abfd4d8574e6cab77ba70a0333785405ee0d19ed3f3c70","sha256:5382cfe890113ead495e501caa24d45d1053e354b6f7faf778e65dd6d2718a5e"],"state_sha256":"56d546eafa54f0e11704ef64744841ad961b2e72a1f243925e874da3996e2e37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VhFstLrcsesuqWH1GY1BZ5sLL1Qn8mVXCs52CuPbXpLRLqRevGrCbyAtNXpeMqLjmuHFoX5SXwaA7ZwemgIUAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:17:28.026216Z","bundle_sha256":"072d86d8072b0ee2d4ba38eb18e45f09cafee1d0fa8b3145f49ccad1c0aa7ec2"}}