{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:UYGJOK3FGF4MYAY5W5S3IGIBWJ","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":"07d5b039926adb576090d542d6a28e9f3043441e59ca82d46e3e23ec706ab502","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-01-12T17:27:42Z","title_canon_sha256":"b64c0838886e1e5a99b7e9a8e909a387b467faa51be462a8d54681fe65f33677"},"schema_version":"1.0","source":{"id":"2401.06713","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.06713","created_at":"2026-07-05T07:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"2401.06713v2","created_at":"2026-07-05T07:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.06713","created_at":"2026-07-05T07:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"UYGJOK3FGF4M","created_at":"2026-07-05T07:44:22Z"},{"alias_kind":"pith_short_16","alias_value":"UYGJOK3FGF4MYAY5","created_at":"2026-07-05T07:44:22Z"},{"alias_kind":"pith_short_8","alias_value":"UYGJOK3F","created_at":"2026-07-05T07:44:22Z"}],"graph_snapshots":[{"event_id":"sha256:dc04dafd99982efea3a29d713e0e51e70e0335b18789e9a751633ea3f5cf8dd5","target":"graph","created_at":"2026-07-05T07:44: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.06713/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A coloring of a graph is an assignment of colors to vertices such that no two neighboring vertices have the same color. The need for memory-efficient coloring algorithms is motivated by their application in computing clique partitions of graphs arising in quantum computations where the objective is to map a large set of Pauli strings into a compact set of unitaries. We present Picasso, a randomized memory-efficient iterative parallel graph coloring algorithm with theoretical sublinear space guarantees under practical assumptions. The parameters of our algorithm provide a trade-off between colo","authors_text":"Bo Peng, Karol Kowalski, Mahantesh Halappanavar, Marco Minutoli, Michela Becchi, Reece Neff, Salman Shuvo, Sayak Mukherjee, S M Ferdous","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-01-12T17:27:42Z","title":"Picasso: Memory-Efficient Graph Coloring Using Palettes With Applications in Quantum Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.06713","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:f8445346fefe6adb6940a96a4973ee9120e0fcf68cc423635020c29def7bb39a","target":"record","created_at":"2026-07-05T07:44: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":"07d5b039926adb576090d542d6a28e9f3043441e59ca82d46e3e23ec706ab502","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-01-12T17:27:42Z","title_canon_sha256":"b64c0838886e1e5a99b7e9a8e909a387b467faa51be462a8d54681fe65f33677"},"schema_version":"1.0","source":{"id":"2401.06713","kind":"arxiv","version":2}},"canonical_sha256":"a60c972b653178cc031db765b41901b2758296668d3d8fc60aeb3d48efef724e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a60c972b653178cc031db765b41901b2758296668d3d8fc60aeb3d48efef724e","first_computed_at":"2026-07-05T07:44:22.459733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:44:22.459733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MFKXE7OvBzLKx4oDNNw0BQwdHMlZBtK1OxQuNFX/mlxflTBZB9Boym86ekDdPZChmOrFM0Z62RBVdsHboHSdCg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:44:22.460211Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.06713","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8445346fefe6adb6940a96a4973ee9120e0fcf68cc423635020c29def7bb39a","sha256:dc04dafd99982efea3a29d713e0e51e70e0335b18789e9a751633ea3f5cf8dd5"],"state_sha256":"e3e98466a3869dd74780109b4b5a701027c2a25f7bd9db2b1bbed516dc66733a"}