{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TWYGVPQS4VPV5RG6R5KE6ZNLA5","short_pith_number":"pith:TWYGVPQS","canonical_record":{"source":{"id":"2607.04887","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-06T10:12:31Z","cross_cats_sorted":[],"title_canon_sha256":"657374d97c801016ca499dbc36c25653b0156352a21c33a39bf7bf181bc1bc51","abstract_canon_sha256":"48c8ffaa00bf8922a7caa27f97e6b29a46527b8d366b41f7ab891082eef70567"},"schema_version":"1.0"},"canonical_sha256":"9db06abe12e55f5ec4de8f544f65ab0762e492284e319c0fb13ee7e177f1fedc","source":{"kind":"arxiv","id":"2607.04887","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.04887","created_at":"2026-07-07T02:20:09Z"},{"alias_kind":"arxiv_version","alias_value":"2607.04887v1","created_at":"2026-07-07T02:20:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04887","created_at":"2026-07-07T02:20:09Z"},{"alias_kind":"pith_short_12","alias_value":"TWYGVPQS4VPV","created_at":"2026-07-07T02:20:09Z"},{"alias_kind":"pith_short_16","alias_value":"TWYGVPQS4VPV5RG6","created_at":"2026-07-07T02:20:09Z"},{"alias_kind":"pith_short_8","alias_value":"TWYGVPQS","created_at":"2026-07-07T02:20:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TWYGVPQS4VPV5RG6R5KE6ZNLA5","target":"record","payload":{"canonical_record":{"source":{"id":"2607.04887","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-06T10:12:31Z","cross_cats_sorted":[],"title_canon_sha256":"657374d97c801016ca499dbc36c25653b0156352a21c33a39bf7bf181bc1bc51","abstract_canon_sha256":"48c8ffaa00bf8922a7caa27f97e6b29a46527b8d366b41f7ab891082eef70567"},"schema_version":"1.0"},"canonical_sha256":"9db06abe12e55f5ec4de8f544f65ab0762e492284e319c0fb13ee7e177f1fedc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:20:09.509829Z","signature_b64":"jrPs9ojM2/B1LUBgTjBtFKYHqftx4KgylJzeiswxW4q6O0tVZqM3RIFOkJr4GUVJnTOgWeRFHPPVR10+gkSuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9db06abe12e55f5ec4de8f544f65ab0762e492284e319c0fb13ee7e177f1fedc","last_reissued_at":"2026-07-07T02:20:09.509114Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:20:09.509114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.04887","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-07T02:20:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"haDDmucA2JKy3UA+0iaC9I03/y5VkpHi9muSpd/OBDKHVvTCv6oxooRwAHjXiFeH8BuGQkT36Ff8UFZ1vPYyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:33:54.406273Z"},"content_sha256":"e15577564b37b697e173e26e5379cf31f3122a2d1c18156a6646c2d29c933c87","schema_version":"1.0","event_id":"sha256:e15577564b37b697e173e26e5379cf31f3122a2d1c18156a6646c2d29c933c87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TWYGVPQS4VPV5RG6R5KE6ZNLA5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symmetry all the way down","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christian Cachin, Ignacio Amores-Sesar, Juan Villacis, Simon Holmgaard Kamp","submitted_at":"2026-07-06T10:12:31Z","abstract_excerpt":"Asymmetric trust generalizes classical symmetric quorum systems by allowing each process to specify its own failure assumptions. While this flexibility enables tolerance of strictly more failure scenarios, it is not known if, in these cases, it is actually possible to solve distributed tasks, and if so, which.\n  We answer this question using the depth hierarchy for asymmetric trust (Amores-Sesar et al., OPODIS~'25), which characterizes how much a process must rely on others to solve a task. We prove that asymmetric trust does not increase the solvability of tasks requiring depth two or more, s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04887","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/2607.04887/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-07T02:20:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r9+aDu0jdj+ZQWjnzfsWD8IabEInODA/rEjv/4zhHA/1AMjmFLPDZCTlVw1z0B5RYkDNbTxNvhBETrCLJ/WFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:33:54.406587Z"},"content_sha256":"2a207e8fa929cb27cf7fa493d2b6976b3e941d0997db659abab1f9cbabebf3ef","schema_version":"1.0","event_id":"sha256:2a207e8fa929cb27cf7fa493d2b6976b3e941d0997db659abab1f9cbabebf3ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TWYGVPQS4VPV5RG6R5KE6ZNLA5/bundle.json","state_url":"https://pith.science/pith/TWYGVPQS4VPV5RG6R5KE6ZNLA5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TWYGVPQS4VPV5RG6R5KE6ZNLA5/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-14T09:33:54Z","links":{"resolver":"https://pith.science/pith/TWYGVPQS4VPV5RG6R5KE6ZNLA5","bundle":"https://pith.science/pith/TWYGVPQS4VPV5RG6R5KE6ZNLA5/bundle.json","state":"https://pith.science/pith/TWYGVPQS4VPV5RG6R5KE6ZNLA5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TWYGVPQS4VPV5RG6R5KE6ZNLA5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TWYGVPQS4VPV5RG6R5KE6ZNLA5","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":"48c8ffaa00bf8922a7caa27f97e6b29a46527b8d366b41f7ab891082eef70567","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-06T10:12:31Z","title_canon_sha256":"657374d97c801016ca499dbc36c25653b0156352a21c33a39bf7bf181bc1bc51"},"schema_version":"1.0","source":{"id":"2607.04887","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.04887","created_at":"2026-07-07T02:20:09Z"},{"alias_kind":"arxiv_version","alias_value":"2607.04887v1","created_at":"2026-07-07T02:20:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04887","created_at":"2026-07-07T02:20:09Z"},{"alias_kind":"pith_short_12","alias_value":"TWYGVPQS4VPV","created_at":"2026-07-07T02:20:09Z"},{"alias_kind":"pith_short_16","alias_value":"TWYGVPQS4VPV5RG6","created_at":"2026-07-07T02:20:09Z"},{"alias_kind":"pith_short_8","alias_value":"TWYGVPQS","created_at":"2026-07-07T02:20:09Z"}],"graph_snapshots":[{"event_id":"sha256:2a207e8fa929cb27cf7fa493d2b6976b3e941d0997db659abab1f9cbabebf3ef","target":"graph","created_at":"2026-07-07T02:20:09Z","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/2607.04887/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Asymmetric trust generalizes classical symmetric quorum systems by allowing each process to specify its own failure assumptions. While this flexibility enables tolerance of strictly more failure scenarios, it is not known if, in these cases, it is actually possible to solve distributed tasks, and if so, which.\n  We answer this question using the depth hierarchy for asymmetric trust (Amores-Sesar et al., OPODIS~'25), which characterizes how much a process must rely on others to solve a task. We prove that asymmetric trust does not increase the solvability of tasks requiring depth two or more, s","authors_text":"Christian Cachin, Ignacio Amores-Sesar, Juan Villacis, Simon Holmgaard Kamp","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-06T10:12:31Z","title":"Symmetry all the way down"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04887","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:e15577564b37b697e173e26e5379cf31f3122a2d1c18156a6646c2d29c933c87","target":"record","created_at":"2026-07-07T02:20:09Z","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":"48c8ffaa00bf8922a7caa27f97e6b29a46527b8d366b41f7ab891082eef70567","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-06T10:12:31Z","title_canon_sha256":"657374d97c801016ca499dbc36c25653b0156352a21c33a39bf7bf181bc1bc51"},"schema_version":"1.0","source":{"id":"2607.04887","kind":"arxiv","version":1}},"canonical_sha256":"9db06abe12e55f5ec4de8f544f65ab0762e492284e319c0fb13ee7e177f1fedc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9db06abe12e55f5ec4de8f544f65ab0762e492284e319c0fb13ee7e177f1fedc","first_computed_at":"2026-07-07T02:20:09.509114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:20:09.509114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jrPs9ojM2/B1LUBgTjBtFKYHqftx4KgylJzeiswxW4q6O0tVZqM3RIFOkJr4GUVJnTOgWeRFHPPVR10+gkSuCw==","signature_status":"signed_v1","signed_at":"2026-07-07T02:20:09.509829Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.04887","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e15577564b37b697e173e26e5379cf31f3122a2d1c18156a6646c2d29c933c87","sha256:2a207e8fa929cb27cf7fa493d2b6976b3e941d0997db659abab1f9cbabebf3ef"],"state_sha256":"3fe6bd5fa697f19a3b025140de0ef7a38e2e070e35370b521a0dde186416559f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"keDb/wQH7Iwg2+gqE4RmiAAFf1jz6QLvggRZp/XsQi3nUP6luR6ddhE2zCW9AyTQXLUIYPumDKj8hNlwa1I/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T09:33:54.409314Z","bundle_sha256":"4cfe2d33fc188cf3146658ccd7adc2b5da96e4bdec950c3cf4dded6856a0cee8"}}