{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:43QTEDR36O4MMJQFFOLGSANZHD","short_pith_number":"pith:43QTEDR3","canonical_record":{"source":{"id":"2404.02673","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-04-03T12:17:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7539827a8634492afcfbf601e5c012eb3c820e2cdad746c412d39f67de47174a","abstract_canon_sha256":"51b52e37592dcb5b2e85468e604669f9d01b2afd24c693478c8dad397c69206d"},"schema_version":"1.0"},"canonical_sha256":"e6e1320e3bf3b8c626052b966901b938d19d4c355f254ca02391454aca272a7f","source":{"kind":"arxiv","id":"2404.02673","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.02673","created_at":"2026-07-05T08:38:08Z"},{"alias_kind":"arxiv_version","alias_value":"2404.02673v3","created_at":"2026-07-05T08:38:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.02673","created_at":"2026-07-05T08:38:08Z"},{"alias_kind":"pith_short_12","alias_value":"43QTEDR36O4M","created_at":"2026-07-05T08:38:08Z"},{"alias_kind":"pith_short_16","alias_value":"43QTEDR36O4MMJQF","created_at":"2026-07-05T08:38:08Z"},{"alias_kind":"pith_short_8","alias_value":"43QTEDR3","created_at":"2026-07-05T08:38:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:43QTEDR36O4MMJQFFOLGSANZHD","target":"record","payload":{"canonical_record":{"source":{"id":"2404.02673","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-04-03T12:17:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7539827a8634492afcfbf601e5c012eb3c820e2cdad746c412d39f67de47174a","abstract_canon_sha256":"51b52e37592dcb5b2e85468e604669f9d01b2afd24c693478c8dad397c69206d"},"schema_version":"1.0"},"canonical_sha256":"e6e1320e3bf3b8c626052b966901b938d19d4c355f254ca02391454aca272a7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:38:08.272375Z","signature_b64":"G8O6pN+OL5Zp43WhjgkOgSyHUmG32zwHMaozoycLSCxm/7o2Y7S+ujTKZUKO8UW60v4o/aDeACeW92sKZ02QDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6e1320e3bf3b8c626052b966901b938d19d4c355f254ca02391454aca272a7f","last_reissued_at":"2026-07-05T08:38:08.271841Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:38:08.271841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.02673","source_version":3,"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-05T08:38:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rNpG1LfLD9kRXWJHLIW2z7HyftIoGjHyoCJcIDkbha1bBXZ9VkiyxPNKmukDMSJJpdv97wS8szR3pM4RlSvVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T11:41:00.362773Z"},"content_sha256":"598d70292399e4faf151da2ff33f0573ba9c9be16a395fa5abc362f75d04018d","schema_version":"1.0","event_id":"sha256:598d70292399e4faf151da2ff33f0573ba9c9be16a395fa5abc362f75d04018d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:43QTEDR36O4MMJQFFOLGSANZHD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"History Trees and Their Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Giovanni Viglietta","submitted_at":"2024-04-03T12:17:49Z","abstract_excerpt":"In the theoretical study of distributed communication networks, \"history trees\" are a discrete structure that naturally models the concept that anonymous agents become distinguishable upon receiving different sets of messages from neighboring agents. By conveniently organizing temporal information in a systematic manner, history trees have been instrumental in the development of optimal deterministic algorithms for networks that are both anonymous and dynamically evolving.\n  This note provides an accessible introduction to history trees, drawing comparisons with more traditional structures fou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.02673","kind":"arxiv","version":3},"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/2404.02673/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-05T08:38:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7xTKyZ8ZslQqbSjpCcOMUicKx+YSk24V1Ok5PsoK8SfajVYnzN6SB52O1iEE+o+YN+qARd7PvAozK4d3jZ3iCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T11:41:00.363585Z"},"content_sha256":"9ad78f0f1967a070680a23fdea1a9140eaecbfc0f016bcb201e4bcdeb1c4a557","schema_version":"1.0","event_id":"sha256:9ad78f0f1967a070680a23fdea1a9140eaecbfc0f016bcb201e4bcdeb1c4a557"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43QTEDR36O4MMJQFFOLGSANZHD/bundle.json","state_url":"https://pith.science/pith/43QTEDR36O4MMJQFFOLGSANZHD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43QTEDR36O4MMJQFFOLGSANZHD/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-11T11:41:00Z","links":{"resolver":"https://pith.science/pith/43QTEDR36O4MMJQFFOLGSANZHD","bundle":"https://pith.science/pith/43QTEDR36O4MMJQFFOLGSANZHD/bundle.json","state":"https://pith.science/pith/43QTEDR36O4MMJQFFOLGSANZHD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43QTEDR36O4MMJQFFOLGSANZHD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:43QTEDR36O4MMJQFFOLGSANZHD","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":"51b52e37592dcb5b2e85468e604669f9d01b2afd24c693478c8dad397c69206d","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-04-03T12:17:49Z","title_canon_sha256":"7539827a8634492afcfbf601e5c012eb3c820e2cdad746c412d39f67de47174a"},"schema_version":"1.0","source":{"id":"2404.02673","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.02673","created_at":"2026-07-05T08:38:08Z"},{"alias_kind":"arxiv_version","alias_value":"2404.02673v3","created_at":"2026-07-05T08:38:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.02673","created_at":"2026-07-05T08:38:08Z"},{"alias_kind":"pith_short_12","alias_value":"43QTEDR36O4M","created_at":"2026-07-05T08:38:08Z"},{"alias_kind":"pith_short_16","alias_value":"43QTEDR36O4MMJQF","created_at":"2026-07-05T08:38:08Z"},{"alias_kind":"pith_short_8","alias_value":"43QTEDR3","created_at":"2026-07-05T08:38:08Z"}],"graph_snapshots":[{"event_id":"sha256:9ad78f0f1967a070680a23fdea1a9140eaecbfc0f016bcb201e4bcdeb1c4a557","target":"graph","created_at":"2026-07-05T08:38: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.02673/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the theoretical study of distributed communication networks, \"history trees\" are a discrete structure that naturally models the concept that anonymous agents become distinguishable upon receiving different sets of messages from neighboring agents. By conveniently organizing temporal information in a systematic manner, history trees have been instrumental in the development of optimal deterministic algorithms for networks that are both anonymous and dynamically evolving.\n  This note provides an accessible introduction to history trees, drawing comparisons with more traditional structures fou","authors_text":"Giovanni Viglietta","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-04-03T12:17:49Z","title":"History Trees and Their Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.02673","kind":"arxiv","version":3},"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:598d70292399e4faf151da2ff33f0573ba9c9be16a395fa5abc362f75d04018d","target":"record","created_at":"2026-07-05T08:38: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":"51b52e37592dcb5b2e85468e604669f9d01b2afd24c693478c8dad397c69206d","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-04-03T12:17:49Z","title_canon_sha256":"7539827a8634492afcfbf601e5c012eb3c820e2cdad746c412d39f67de47174a"},"schema_version":"1.0","source":{"id":"2404.02673","kind":"arxiv","version":3}},"canonical_sha256":"e6e1320e3bf3b8c626052b966901b938d19d4c355f254ca02391454aca272a7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6e1320e3bf3b8c626052b966901b938d19d4c355f254ca02391454aca272a7f","first_computed_at":"2026-07-05T08:38:08.271841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:38:08.271841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G8O6pN+OL5Zp43WhjgkOgSyHUmG32zwHMaozoycLSCxm/7o2Y7S+ujTKZUKO8UW60v4o/aDeACeW92sKZ02QDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:38:08.272375Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.02673","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:598d70292399e4faf151da2ff33f0573ba9c9be16a395fa5abc362f75d04018d","sha256:9ad78f0f1967a070680a23fdea1a9140eaecbfc0f016bcb201e4bcdeb1c4a557"],"state_sha256":"6ffe981a4479e634784e44c035948ad34bf142ed1d1a8802cf2e2abca784a68c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UTrigkORXrhj8PpIQr64sJnh0Bk6UmLvy1oALGjI+bsFlZgL7EtTSZr8zAA/0pXFz54wBtBpjJmcEPTC1nWsAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T11:41:00.369735Z","bundle_sha256":"414a5e0bb30c24522e87efcf11f46e731f18567e60df2f38386570c272fdaca4"}}