{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZOF6TVYFM6AMPFEDMQXA26CT3B","short_pith_number":"pith:ZOF6TVYF","schema_version":"1.0","canonical_sha256":"cb8be9d7056780c79483642e0d7853d867cd93d794d598e23c48071d8360ab67","source":{"kind":"arxiv","id":"1803.05606","version":1},"attestation_state":"computed","paper":{"title":"Securely Solving the Distributed Graph Coloring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Haibing Lu, Jaideep Vaidya, Yuan Hong","submitted_at":"2018-03-15T05:58:56Z","abstract_excerpt":"Combinatorial optimization is a fundamental problem found in many fields. In many real life situations, the constraints and the objective function forming the optimization problem are naturally distributed amongst different sites in some fashion. A typical approach for solving such problem is to collect all of this information together and centrally solve the problem. However, this requires all parties to completely share their information, which may lead to serious privacy issues. Thus, it is desirable to propose a privacy preserving technique that can securely solve specific combinatorial op"},"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":"1803.05606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-03-15T05:58:56Z","cross_cats_sorted":[],"title_canon_sha256":"cd1cc5c5e3856f7f8b4d1a0dac0de1640c800981a038671d1946687daa9fd261","abstract_canon_sha256":"463e05537c21a560b1093a3ce1bad224ec5bb963742ec6ca9c62c0c0851b8117"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:55.056052Z","signature_b64":"efNsC9Dc/Q/afNjwCy9QcGok1D1JIlpoikO5RQHey/9ST6MUo9hlnOfMxC8XX0uXekUM4xalL5fjD6RFf8xRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb8be9d7056780c79483642e0d7853d867cd93d794d598e23c48071d8360ab67","last_reissued_at":"2026-05-18T00:20:55.055616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:55.055616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Securely Solving the Distributed Graph Coloring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Haibing Lu, Jaideep Vaidya, Yuan Hong","submitted_at":"2018-03-15T05:58:56Z","abstract_excerpt":"Combinatorial optimization is a fundamental problem found in many fields. In many real life situations, the constraints and the objective function forming the optimization problem are naturally distributed amongst different sites in some fashion. A typical approach for solving such problem is to collect all of this information together and centrally solve the problem. However, this requires all parties to completely share their information, which may lead to serious privacy issues. Thus, it is desirable to propose a privacy preserving technique that can securely solve specific combinatorial op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05606","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":"1803.05606","created_at":"2026-05-18T00:20:55.055681+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05606v1","created_at":"2026-05-18T00:20:55.055681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05606","created_at":"2026-05-18T00:20:55.055681+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZOF6TVYFM6AM","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZOF6TVYFM6AMPFED","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZOF6TVYF","created_at":"2026-05-18T12:33:07.085635+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/ZOF6TVYFM6AMPFEDMQXA26CT3B","json":"https://pith.science/pith/ZOF6TVYFM6AMPFEDMQXA26CT3B.json","graph_json":"https://pith.science/api/pith-number/ZOF6TVYFM6AMPFEDMQXA26CT3B/graph.json","events_json":"https://pith.science/api/pith-number/ZOF6TVYFM6AMPFEDMQXA26CT3B/events.json","paper":"https://pith.science/paper/ZOF6TVYF"},"agent_actions":{"view_html":"https://pith.science/pith/ZOF6TVYFM6AMPFEDMQXA26CT3B","download_json":"https://pith.science/pith/ZOF6TVYFM6AMPFEDMQXA26CT3B.json","view_paper":"https://pith.science/paper/ZOF6TVYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05606&json=true","fetch_graph":"https://pith.science/api/pith-number/ZOF6TVYFM6AMPFEDMQXA26CT3B/graph.json","fetch_events":"https://pith.science/api/pith-number/ZOF6TVYFM6AMPFEDMQXA26CT3B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZOF6TVYFM6AMPFEDMQXA26CT3B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZOF6TVYFM6AMPFEDMQXA26CT3B/action/storage_attestation","attest_author":"https://pith.science/pith/ZOF6TVYFM6AMPFEDMQXA26CT3B/action/author_attestation","sign_citation":"https://pith.science/pith/ZOF6TVYFM6AMPFEDMQXA26CT3B/action/citation_signature","submit_replication":"https://pith.science/pith/ZOF6TVYFM6AMPFEDMQXA26CT3B/action/replication_record"}},"created_at":"2026-05-18T00:20:55.055681+00:00","updated_at":"2026-05-18T00:20:55.055681+00:00"}