{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:D4H7O37Z2TNQ4KWJRAEIKGCPLT","short_pith_number":"pith:D4H7O37Z","canonical_record":{"source":{"id":"2109.11130","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-09-23T03:52:38Z","cross_cats_sorted":[],"title_canon_sha256":"24ae05fa89b83fe172d88dc89ce26f2770f62ebb03fcd952f9f54ef2798cea03","abstract_canon_sha256":"3c5cf17be697152795e8ee9e2f45717104d969dee1c803bc21fb3715799593ce"},"schema_version":"1.0"},"canonical_sha256":"1f0ff76ff9d4db0e2ac9880885184f5ce3efab2e84acc534ac748c6048e97ad6","source":{"kind":"arxiv","id":"2109.11130","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.11130","created_at":"2026-07-05T03:16:54Z"},{"alias_kind":"arxiv_version","alias_value":"2109.11130v1","created_at":"2026-07-05T03:16:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.11130","created_at":"2026-07-05T03:16:54Z"},{"alias_kind":"pith_short_12","alias_value":"D4H7O37Z2TNQ","created_at":"2026-07-05T03:16:54Z"},{"alias_kind":"pith_short_16","alias_value":"D4H7O37Z2TNQ4KWJ","created_at":"2026-07-05T03:16:54Z"},{"alias_kind":"pith_short_8","alias_value":"D4H7O37Z","created_at":"2026-07-05T03:16:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:D4H7O37Z2TNQ4KWJRAEIKGCPLT","target":"record","payload":{"canonical_record":{"source":{"id":"2109.11130","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-09-23T03:52:38Z","cross_cats_sorted":[],"title_canon_sha256":"24ae05fa89b83fe172d88dc89ce26f2770f62ebb03fcd952f9f54ef2798cea03","abstract_canon_sha256":"3c5cf17be697152795e8ee9e2f45717104d969dee1c803bc21fb3715799593ce"},"schema_version":"1.0"},"canonical_sha256":"1f0ff76ff9d4db0e2ac9880885184f5ce3efab2e84acc534ac748c6048e97ad6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:16:54.963985Z","signature_b64":"6KGS/aj5oXi8qCh8V0GkqWtuMasqIzHBdJVmqaAymfDnPM2CWvzJbe+nJYaY+gXyHKXd22cZRUjfzEPGgbijBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f0ff76ff9d4db0e2ac9880885184f5ce3efab2e84acc534ac748c6048e97ad6","last_reissued_at":"2026-07-05T03:16:54.963505Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:16:54.963505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2109.11130","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-07-05T03:16:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i0x+BwFU2xUKbZyt2LU2lkf0KySq69dUlQdeSNMWw/8SIt26VJb4GaA6RAnkdfDisPN8FruMRxbh2tNEtVpLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:14:21.815398Z"},"content_sha256":"323e6da8d56a441e1e843c43c3d6c38844afecc24a8963624c0a9202941c8ef5","schema_version":"1.0","event_id":"sha256:323e6da8d56a441e1e843c43c3d6c38844afecc24a8963624c0a9202941c8ef5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:D4H7O37Z2TNQ4KWJRAEIKGCPLT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adversarially Robust Coloring for Graph Streams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Chakrabarti, Manuel Stoeckl, Prantar Ghosh","submitted_at":"2021-09-23T03:52:38Z","abstract_excerpt":"A streaming algorithm is considered to be adversarially robust if it provides correct outputs with high probability even when the stream updates are chosen by an adversary who may observe and react to the past outputs of the algorithm. We grow the burgeoning body of work on such algorithms in a new direction by studying robust algorithms for the problem of maintaining a valid vertex coloring of an $n$-vertex graph given as a stream of edges. Following standard practice, we focus on graphs with maximum degree at most $\\Delta$ and aim for colorings using a small number $f(\\Delta)$ of colors.\n  A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.11130","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.11130/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-05T03:16:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q3ebgc3nurFpc9FD+fPFpegmkoLYLS3XToRnhu5RE3dSJAVDDQ0PpdJmGW6qrm4ywX6icveUUqDO8TeQmVdVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:14:21.815785Z"},"content_sha256":"f6646da8fc164b89d3060d93b97d14ef8e1a706930fe31fcc37c49a4be2e6448","schema_version":"1.0","event_id":"sha256:f6646da8fc164b89d3060d93b97d14ef8e1a706930fe31fcc37c49a4be2e6448"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D4H7O37Z2TNQ4KWJRAEIKGCPLT/bundle.json","state_url":"https://pith.science/pith/D4H7O37Z2TNQ4KWJRAEIKGCPLT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D4H7O37Z2TNQ4KWJRAEIKGCPLT/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-07-07T11:14:21Z","links":{"resolver":"https://pith.science/pith/D4H7O37Z2TNQ4KWJRAEIKGCPLT","bundle":"https://pith.science/pith/D4H7O37Z2TNQ4KWJRAEIKGCPLT/bundle.json","state":"https://pith.science/pith/D4H7O37Z2TNQ4KWJRAEIKGCPLT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D4H7O37Z2TNQ4KWJRAEIKGCPLT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:D4H7O37Z2TNQ4KWJRAEIKGCPLT","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":"3c5cf17be697152795e8ee9e2f45717104d969dee1c803bc21fb3715799593ce","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-09-23T03:52:38Z","title_canon_sha256":"24ae05fa89b83fe172d88dc89ce26f2770f62ebb03fcd952f9f54ef2798cea03"},"schema_version":"1.0","source":{"id":"2109.11130","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.11130","created_at":"2026-07-05T03:16:54Z"},{"alias_kind":"arxiv_version","alias_value":"2109.11130v1","created_at":"2026-07-05T03:16:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.11130","created_at":"2026-07-05T03:16:54Z"},{"alias_kind":"pith_short_12","alias_value":"D4H7O37Z2TNQ","created_at":"2026-07-05T03:16:54Z"},{"alias_kind":"pith_short_16","alias_value":"D4H7O37Z2TNQ4KWJ","created_at":"2026-07-05T03:16:54Z"},{"alias_kind":"pith_short_8","alias_value":"D4H7O37Z","created_at":"2026-07-05T03:16:54Z"}],"graph_snapshots":[{"event_id":"sha256:f6646da8fc164b89d3060d93b97d14ef8e1a706930fe31fcc37c49a4be2e6448","target":"graph","created_at":"2026-07-05T03:16:54Z","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/2109.11130/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A streaming algorithm is considered to be adversarially robust if it provides correct outputs with high probability even when the stream updates are chosen by an adversary who may observe and react to the past outputs of the algorithm. We grow the burgeoning body of work on such algorithms in a new direction by studying robust algorithms for the problem of maintaining a valid vertex coloring of an $n$-vertex graph given as a stream of edges. Following standard practice, we focus on graphs with maximum degree at most $\\Delta$ and aim for colorings using a small number $f(\\Delta)$ of colors.\n  A","authors_text":"Amit Chakrabarti, Manuel Stoeckl, Prantar Ghosh","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-09-23T03:52:38Z","title":"Adversarially Robust Coloring for Graph Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.11130","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:323e6da8d56a441e1e843c43c3d6c38844afecc24a8963624c0a9202941c8ef5","target":"record","created_at":"2026-07-05T03:16:54Z","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":"3c5cf17be697152795e8ee9e2f45717104d969dee1c803bc21fb3715799593ce","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-09-23T03:52:38Z","title_canon_sha256":"24ae05fa89b83fe172d88dc89ce26f2770f62ebb03fcd952f9f54ef2798cea03"},"schema_version":"1.0","source":{"id":"2109.11130","kind":"arxiv","version":1}},"canonical_sha256":"1f0ff76ff9d4db0e2ac9880885184f5ce3efab2e84acc534ac748c6048e97ad6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f0ff76ff9d4db0e2ac9880885184f5ce3efab2e84acc534ac748c6048e97ad6","first_computed_at":"2026-07-05T03:16:54.963505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:16:54.963505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6KGS/aj5oXi8qCh8V0GkqWtuMasqIzHBdJVmqaAymfDnPM2CWvzJbe+nJYaY+gXyHKXd22cZRUjfzEPGgbijBA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:16:54.963985Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.11130","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:323e6da8d56a441e1e843c43c3d6c38844afecc24a8963624c0a9202941c8ef5","sha256:f6646da8fc164b89d3060d93b97d14ef8e1a706930fe31fcc37c49a4be2e6448"],"state_sha256":"c33fe7b1dd1e8af7f1af010dbdf833abf42c9ce1d7ccd435b06cc2cd430d066e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ezbubioc/WWOTZNrvHQhxh3xxQq95QeANWakWTTy9sbBPsT/CFj0XQlsfuWFVor3q5XVorNczKBkNPyrVA4FBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:14:21.817877Z","bundle_sha256":"ed892a7b9d8103d7928f0f478d7a006ff0e99898ef9f7c6803925efc0e7c01e8"}}