{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VIVHPV2SRO35KJLWXB2TFMX53K","short_pith_number":"pith:VIVHPV2S","canonical_record":{"source":{"id":"1712.04393","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-12T17:02:08Z","cross_cats_sorted":[],"title_canon_sha256":"9b3075c96aa1611afd61ec12ba7a79eac4dc85e021c126d6efcd32f9829a4325","abstract_canon_sha256":"a655d119d0b9797cdff217452943cff501c4c7cd670d86657876b73bbf4ef022"},"schema_version":"1.0"},"canonical_sha256":"aa2a77d7528bb7d52576b87532b2fddabf8ac57e847c073519eb718488d90c6a","source":{"kind":"arxiv","id":"1712.04393","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04393","created_at":"2026-05-18T00:28:08Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04393v1","created_at":"2026-05-18T00:28:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04393","created_at":"2026-05-18T00:28:08Z"},{"alias_kind":"pith_short_12","alias_value":"VIVHPV2SRO35","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VIVHPV2SRO35KJLW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VIVHPV2S","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VIVHPV2SRO35KJLWXB2TFMX53K","target":"record","payload":{"canonical_record":{"source":{"id":"1712.04393","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-12T17:02:08Z","cross_cats_sorted":[],"title_canon_sha256":"9b3075c96aa1611afd61ec12ba7a79eac4dc85e021c126d6efcd32f9829a4325","abstract_canon_sha256":"a655d119d0b9797cdff217452943cff501c4c7cd670d86657876b73bbf4ef022"},"schema_version":"1.0"},"canonical_sha256":"aa2a77d7528bb7d52576b87532b2fddabf8ac57e847c073519eb718488d90c6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:08.146648Z","signature_b64":"K0L7wx7sjiPXgGsIczEFCE7+yNs9QFJ18DOEleP+Kq7R6Tq+JnDHjb4HiDYYyv+FYtBZG/kPTfYcu6LlqBjWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa2a77d7528bb7d52576b87532b2fddabf8ac57e847c073519eb718488d90c6a","last_reissued_at":"2026-05-18T00:28:08.145934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:08.145934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.04393","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:28:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xdr/W3G0Gco65HGM7gG+htFd5cG+f3r9ZSlE8uuAhfowmjXx/aF9afno8wpmHS7jn9DEvzrWFbtizgKUAXiqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:41:10.270002Z"},"content_sha256":"158c9b1d1886bc69a316eeba1df79677a91c15e81815d7814c12e17866de8eeb","schema_version":"1.0","event_id":"sha256:158c9b1d1886bc69a316eeba1df79677a91c15e81815d7814c12e17866de8eeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VIVHPV2SRO35KJLWXB2TFMX53K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A characterization of colorless anonymous $t$-resilient task computability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Carole Delporte-Gallet, Hugues Fauconnier, Nayuta Yanagisawa, Sergio Rajsbaum","submitted_at":"2017-12-12T17:02:08Z","abstract_excerpt":"A task is a distributed problem for $n$ processes, in which each process starts with a private input value, communicates with other processes, and eventually decides an output value. A task is colorless if each process can adopt the input or output value of another process. Colorless tasks are well studied in the non-anonymous shared-memory model where each process has a distinct identifier that can be used to access a single-writer/multi-reader shared register. In the anonymous case, where processes have no identifiers and communicate through multi-writer/multi-reader registers, there is a re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04393","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:28:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y5diwoswPf/FierD0h7tR09YgOSYNfqZYRWCdQuMKbPdsdcds52NTBYiwJvP6xBP6DRyhCAqLjc5EccdmO02Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:41:10.270356Z"},"content_sha256":"d617b0fce9089763876dbb6f97375b31930ac7b6362a4bc3ba73a4e042425ac3","schema_version":"1.0","event_id":"sha256:d617b0fce9089763876dbb6f97375b31930ac7b6362a4bc3ba73a4e042425ac3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VIVHPV2SRO35KJLWXB2TFMX53K/bundle.json","state_url":"https://pith.science/pith/VIVHPV2SRO35KJLWXB2TFMX53K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VIVHPV2SRO35KJLWXB2TFMX53K/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-26T09:41:10Z","links":{"resolver":"https://pith.science/pith/VIVHPV2SRO35KJLWXB2TFMX53K","bundle":"https://pith.science/pith/VIVHPV2SRO35KJLWXB2TFMX53K/bundle.json","state":"https://pith.science/pith/VIVHPV2SRO35KJLWXB2TFMX53K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VIVHPV2SRO35KJLWXB2TFMX53K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VIVHPV2SRO35KJLWXB2TFMX53K","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":"a655d119d0b9797cdff217452943cff501c4c7cd670d86657876b73bbf4ef022","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-12T17:02:08Z","title_canon_sha256":"9b3075c96aa1611afd61ec12ba7a79eac4dc85e021c126d6efcd32f9829a4325"},"schema_version":"1.0","source":{"id":"1712.04393","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04393","created_at":"2026-05-18T00:28:08Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04393v1","created_at":"2026-05-18T00:28:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04393","created_at":"2026-05-18T00:28:08Z"},{"alias_kind":"pith_short_12","alias_value":"VIVHPV2SRO35","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VIVHPV2SRO35KJLW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VIVHPV2S","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:d617b0fce9089763876dbb6f97375b31930ac7b6362a4bc3ba73a4e042425ac3","target":"graph","created_at":"2026-05-18T00:28:08Z","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":"A task is a distributed problem for $n$ processes, in which each process starts with a private input value, communicates with other processes, and eventually decides an output value. A task is colorless if each process can adopt the input or output value of another process. Colorless tasks are well studied in the non-anonymous shared-memory model where each process has a distinct identifier that can be used to access a single-writer/multi-reader shared register. In the anonymous case, where processes have no identifiers and communicate through multi-writer/multi-reader registers, there is a re","authors_text":"Carole Delporte-Gallet, Hugues Fauconnier, Nayuta Yanagisawa, Sergio Rajsbaum","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-12T17:02:08Z","title":"A characterization of colorless anonymous $t$-resilient task computability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04393","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:158c9b1d1886bc69a316eeba1df79677a91c15e81815d7814c12e17866de8eeb","target":"record","created_at":"2026-05-18T00:28:08Z","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":"a655d119d0b9797cdff217452943cff501c4c7cd670d86657876b73bbf4ef022","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-12T17:02:08Z","title_canon_sha256":"9b3075c96aa1611afd61ec12ba7a79eac4dc85e021c126d6efcd32f9829a4325"},"schema_version":"1.0","source":{"id":"1712.04393","kind":"arxiv","version":1}},"canonical_sha256":"aa2a77d7528bb7d52576b87532b2fddabf8ac57e847c073519eb718488d90c6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa2a77d7528bb7d52576b87532b2fddabf8ac57e847c073519eb718488d90c6a","first_computed_at":"2026-05-18T00:28:08.145934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:08.145934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K0L7wx7sjiPXgGsIczEFCE7+yNs9QFJ18DOEleP+Kq7R6Tq+JnDHjb4HiDYYyv+FYtBZG/kPTfYcu6LlqBjWBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:08.146648Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.04393","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:158c9b1d1886bc69a316eeba1df79677a91c15e81815d7814c12e17866de8eeb","sha256:d617b0fce9089763876dbb6f97375b31930ac7b6362a4bc3ba73a4e042425ac3"],"state_sha256":"1ea148a670ed18a0aeb6de648c0b98cc75f2b75518ad2aca030746ccf232b54f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZpfjoApaTGL6OphtTcYaeBiHT7VTZKskzXeqfhQPJ1cKZvOiZ9wf+oo407XlIhRTqpioGx1lPBP7NJncWqGkDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T09:41:10.272275Z","bundle_sha256":"e2c36365223e344db13411ecec352ca1a69ca8d8fb044b12b06eaf621194d425"}}