{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:UIDNG5UYA4SUO4RD2SX2HBQWHX","short_pith_number":"pith:UIDNG5UY","canonical_record":{"source":{"id":"2211.11912","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-21T23:49:28Z","cross_cats_sorted":[],"title_canon_sha256":"c305ce54ba0054bc261f536e33b2e0df474d3f90a68f6c84035f4599aae841ff","abstract_canon_sha256":"498e5f1283c4a563bb1342468fce8771be4ba83130ee0b1fc8ba182496a65187"},"schema_version":"1.0"},"canonical_sha256":"a206d376980725477223d4afa386163dc0cf4620ffbbd6920971bec015a540d8","source":{"kind":"arxiv","id":"2211.11912","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.11912","created_at":"2026-07-05T05:20:16Z"},{"alias_kind":"arxiv_version","alias_value":"2211.11912v2","created_at":"2026-07-05T05:20:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.11912","created_at":"2026-07-05T05:20:16Z"},{"alias_kind":"pith_short_12","alias_value":"UIDNG5UYA4SU","created_at":"2026-07-05T05:20:16Z"},{"alias_kind":"pith_short_16","alias_value":"UIDNG5UYA4SUO4RD","created_at":"2026-07-05T05:20:16Z"},{"alias_kind":"pith_short_8","alias_value":"UIDNG5UY","created_at":"2026-07-05T05:20:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:UIDNG5UYA4SUO4RD2SX2HBQWHX","target":"record","payload":{"canonical_record":{"source":{"id":"2211.11912","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-21T23:49:28Z","cross_cats_sorted":[],"title_canon_sha256":"c305ce54ba0054bc261f536e33b2e0df474d3f90a68f6c84035f4599aae841ff","abstract_canon_sha256":"498e5f1283c4a563bb1342468fce8771be4ba83130ee0b1fc8ba182496a65187"},"schema_version":"1.0"},"canonical_sha256":"a206d376980725477223d4afa386163dc0cf4620ffbbd6920971bec015a540d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:20:16.141810Z","signature_b64":"po6PsUNRet8OfAzajCinFR38yONiWCHt4FmIkm54fdXKm0mYalfTWwomp523N6ypS61nic7eH6SfkpMmHtbeAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a206d376980725477223d4afa386163dc0cf4620ffbbd6920971bec015a540d8","last_reissued_at":"2026-07-05T05:20:16.141401Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:20:16.141401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.11912","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-05T05:20:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PYWVjvAvoTAeyWEbfCGEQRFXozGJ30oZnKpPVmWmJX8dU7xishZRlE/h+h3Jhbz1WKy5/qHUTapQQvFfbRoSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:54:36.017672Z"},"content_sha256":"14a9480ca6bf2452cbbfe50b211e9e24600ed8fa6427c5d68b901eed1cc83e65","schema_version":"1.0","event_id":"sha256:14a9480ca6bf2452cbbfe50b211e9e24600ed8fa6427c5d68b901eed1cc83e65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:UIDNG5UYA4SUO4RD2SX2HBQWHX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quasi-stable Coloring for Graph Compression: Approximating Max-Flow, Linear Programs, and Centrality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dan Suciu, Moe Kayali","submitted_at":"2022-11-21T23:49:28Z","abstract_excerpt":"We propose quasi-stable coloring, an approximate version of stable coloring. Stable coloring, also called color refinement, is a well-studied technique in graph theory for classifying vertices, which can be used to build compact, lossless representations of graphs. However, its usefulness is limited due to its reliance on strict symmetries. Real data compresses very poorly using color refinement. We propose the first, to our knowledge, approximate color refinement scheme, which we call quasi-stable coloring. By using approximation, we alleviate the need for strict symmetry, and allow for a tra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.11912","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/2211.11912/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-05T05:20:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QLL1veaC0InuiHYxQbJWf80gLhq6SGvxa5nbPkQZo1FwU2nwPYqYxhnc6sXx7lYnI9SUh7sZexEokOGvOYXgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:54:36.018235Z"},"content_sha256":"3acbd7ce3704cc170d617e4feffd30cf99f4ba81a360335090ef994eb210cacc","schema_version":"1.0","event_id":"sha256:3acbd7ce3704cc170d617e4feffd30cf99f4ba81a360335090ef994eb210cacc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UIDNG5UYA4SUO4RD2SX2HBQWHX/bundle.json","state_url":"https://pith.science/pith/UIDNG5UYA4SUO4RD2SX2HBQWHX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UIDNG5UYA4SUO4RD2SX2HBQWHX/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-08-05T08:54:36Z","links":{"resolver":"https://pith.science/pith/UIDNG5UYA4SUO4RD2SX2HBQWHX","bundle":"https://pith.science/pith/UIDNG5UYA4SUO4RD2SX2HBQWHX/bundle.json","state":"https://pith.science/pith/UIDNG5UYA4SUO4RD2SX2HBQWHX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UIDNG5UYA4SUO4RD2SX2HBQWHX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:UIDNG5UYA4SUO4RD2SX2HBQWHX","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":"498e5f1283c4a563bb1342468fce8771be4ba83130ee0b1fc8ba182496a65187","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-21T23:49:28Z","title_canon_sha256":"c305ce54ba0054bc261f536e33b2e0df474d3f90a68f6c84035f4599aae841ff"},"schema_version":"1.0","source":{"id":"2211.11912","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.11912","created_at":"2026-07-05T05:20:16Z"},{"alias_kind":"arxiv_version","alias_value":"2211.11912v2","created_at":"2026-07-05T05:20:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.11912","created_at":"2026-07-05T05:20:16Z"},{"alias_kind":"pith_short_12","alias_value":"UIDNG5UYA4SU","created_at":"2026-07-05T05:20:16Z"},{"alias_kind":"pith_short_16","alias_value":"UIDNG5UYA4SUO4RD","created_at":"2026-07-05T05:20:16Z"},{"alias_kind":"pith_short_8","alias_value":"UIDNG5UY","created_at":"2026-07-05T05:20:16Z"}],"graph_snapshots":[{"event_id":"sha256:3acbd7ce3704cc170d617e4feffd30cf99f4ba81a360335090ef994eb210cacc","target":"graph","created_at":"2026-07-05T05:20:16Z","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/2211.11912/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose quasi-stable coloring, an approximate version of stable coloring. Stable coloring, also called color refinement, is a well-studied technique in graph theory for classifying vertices, which can be used to build compact, lossless representations of graphs. However, its usefulness is limited due to its reliance on strict symmetries. Real data compresses very poorly using color refinement. We propose the first, to our knowledge, approximate color refinement scheme, which we call quasi-stable coloring. By using approximation, we alleviate the need for strict symmetry, and allow for a tra","authors_text":"Dan Suciu, Moe Kayali","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-21T23:49:28Z","title":"Quasi-stable Coloring for Graph Compression: Approximating Max-Flow, Linear Programs, and Centrality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.11912","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:14a9480ca6bf2452cbbfe50b211e9e24600ed8fa6427c5d68b901eed1cc83e65","target":"record","created_at":"2026-07-05T05:20:16Z","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":"498e5f1283c4a563bb1342468fce8771be4ba83130ee0b1fc8ba182496a65187","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-21T23:49:28Z","title_canon_sha256":"c305ce54ba0054bc261f536e33b2e0df474d3f90a68f6c84035f4599aae841ff"},"schema_version":"1.0","source":{"id":"2211.11912","kind":"arxiv","version":2}},"canonical_sha256":"a206d376980725477223d4afa386163dc0cf4620ffbbd6920971bec015a540d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a206d376980725477223d4afa386163dc0cf4620ffbbd6920971bec015a540d8","first_computed_at":"2026-07-05T05:20:16.141401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:20:16.141401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"po6PsUNRet8OfAzajCinFR38yONiWCHt4FmIkm54fdXKm0mYalfTWwomp523N6ypS61nic7eH6SfkpMmHtbeAg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:20:16.141810Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.11912","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14a9480ca6bf2452cbbfe50b211e9e24600ed8fa6427c5d68b901eed1cc83e65","sha256:3acbd7ce3704cc170d617e4feffd30cf99f4ba81a360335090ef994eb210cacc"],"state_sha256":"cf2243f078ac6e90f249da2223c5bc69cbf08752edee6db30a8821bb5be74ba1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cX4kL6B43v47qRShojxq+HPmix/8VRjZksmUuzgBO0gWrboagUQW8vXH0yik3koYHNuWXnifEekGB89EbmOwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T08:54:36.023484Z","bundle_sha256":"a805341a4df02f8cd909865d70f094219c85a2b9849f53fdf196cc0c55282a63"}}