{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:D4WJWA3LX22GDB77U2EZ3UODNI","short_pith_number":"pith:D4WJWA3L","canonical_record":{"source":{"id":"1711.09148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-24T21:47:11Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5fec32d1323d80ecf374db3c00007ab9f4e4a195850b37ff603ffddf9d332d61","abstract_canon_sha256":"bf0bfe0a4c025e5081afe1f0a0ff02d31265fec8a4443895b43b3f5eccc6fb6c"},"schema_version":"1.0"},"canonical_sha256":"1f2c9b036bbeb46187ffa6899dd1c36a069b8b299943b420f78cac889b8c2bc6","source":{"kind":"arxiv","id":"1711.09148","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.09148","created_at":"2026-05-18T00:29:40Z"},{"alias_kind":"arxiv_version","alias_value":"1711.09148v1","created_at":"2026-05-18T00:29:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09148","created_at":"2026-05-18T00:29:40Z"},{"alias_kind":"pith_short_12","alias_value":"D4WJWA3LX22G","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D4WJWA3LX22GDB77","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D4WJWA3L","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:D4WJWA3LX22GDB77U2EZ3UODNI","target":"record","payload":{"canonical_record":{"source":{"id":"1711.09148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-24T21:47:11Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5fec32d1323d80ecf374db3c00007ab9f4e4a195850b37ff603ffddf9d332d61","abstract_canon_sha256":"bf0bfe0a4c025e5081afe1f0a0ff02d31265fec8a4443895b43b3f5eccc6fb6c"},"schema_version":"1.0"},"canonical_sha256":"1f2c9b036bbeb46187ffa6899dd1c36a069b8b299943b420f78cac889b8c2bc6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:40.444635Z","signature_b64":"U7wq95cM1OrMWNGc/Vf61IYV7Oow1YnxCThjY0m4OdDBuDqzxGA4gxzgGc7BgKMctjoyK7Sig9zJc0g7083uDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f2c9b036bbeb46187ffa6899dd1c36a069b8b299943b420f78cac889b8c2bc6","last_reissued_at":"2026-05-18T00:29:40.443986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:40.443986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.09148","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:29:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZoFu29PBYm9x3xmWueMDNu2xlHDQLWhTgSkrApXIHwIyQp5A6YiWslrxVOlb29xlF4wmvbaVPr+PSuDRFDv2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:32:04.568975Z"},"content_sha256":"fc5a840812bf666048ec263969aca27075b4d34e2dc4891d06bcb4b627c09438","schema_version":"1.0","event_id":"sha256:fc5a840812bf666048ec263969aca27075b4d34e2dc4891d06bcb4b627c09438"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:D4WJWA3LX22GDB77U2EZ3UODNI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer, Wolfgang Dvo\\v{r}\\'ak","submitted_at":"2017-11-24T21:47:11Z","abstract_excerpt":"A model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist of symbolic operations, which are expensive in comparison to the standard RAM operations. We give lower bounds on the number of symbolic operations for basic graph problems such as the computation of the strongly connected components and of the approximate diameter as well as for fundamental problems in model checking such as safety, liveness, and co-liveness. Our lower bounds are linear in the number of vertices of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09148","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:29:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nVYZctEb9qPeBCx+X12cQUv0etck/yLq3DNyWEWAzmSYJLh1rvPRNjBBAn0RmcSJ+1WFN0qXGWyZ+zxmLKJTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:32:04.569595Z"},"content_sha256":"6304a3aafd8e5c2a1e29f17474d2e49473a276f01bbc0c039ca7b61e37d91301","schema_version":"1.0","event_id":"sha256:6304a3aafd8e5c2a1e29f17474d2e49473a276f01bbc0c039ca7b61e37d91301"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D4WJWA3LX22GDB77U2EZ3UODNI/bundle.json","state_url":"https://pith.science/pith/D4WJWA3LX22GDB77U2EZ3UODNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D4WJWA3LX22GDB77U2EZ3UODNI/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-05-26T07:32:04Z","links":{"resolver":"https://pith.science/pith/D4WJWA3LX22GDB77U2EZ3UODNI","bundle":"https://pith.science/pith/D4WJWA3LX22GDB77U2EZ3UODNI/bundle.json","state":"https://pith.science/pith/D4WJWA3LX22GDB77U2EZ3UODNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D4WJWA3LX22GDB77U2EZ3UODNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:D4WJWA3LX22GDB77U2EZ3UODNI","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":"bf0bfe0a4c025e5081afe1f0a0ff02d31265fec8a4443895b43b3f5eccc6fb6c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-24T21:47:11Z","title_canon_sha256":"5fec32d1323d80ecf374db3c00007ab9f4e4a195850b37ff603ffddf9d332d61"},"schema_version":"1.0","source":{"id":"1711.09148","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.09148","created_at":"2026-05-18T00:29:40Z"},{"alias_kind":"arxiv_version","alias_value":"1711.09148v1","created_at":"2026-05-18T00:29:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09148","created_at":"2026-05-18T00:29:40Z"},{"alias_kind":"pith_short_12","alias_value":"D4WJWA3LX22G","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D4WJWA3LX22GDB77","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D4WJWA3L","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:6304a3aafd8e5c2a1e29f17474d2e49473a276f01bbc0c039ca7b61e37d91301","target":"graph","created_at":"2026-05-18T00:29:40Z","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 model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist of symbolic operations, which are expensive in comparison to the standard RAM operations. We give lower bounds on the number of symbolic operations for basic graph problems such as the computation of the strongly connected components and of the approximate diameter as well as for fundamental problems in model checking such as safety, liveness, and co-liveness. Our lower bounds are linear in the number of vertices of t","authors_text":"Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer, Wolfgang Dvo\\v{r}\\'ak","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-24T21:47:11Z","title":"Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09148","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:fc5a840812bf666048ec263969aca27075b4d34e2dc4891d06bcb4b627c09438","target":"record","created_at":"2026-05-18T00:29:40Z","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":"bf0bfe0a4c025e5081afe1f0a0ff02d31265fec8a4443895b43b3f5eccc6fb6c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-24T21:47:11Z","title_canon_sha256":"5fec32d1323d80ecf374db3c00007ab9f4e4a195850b37ff603ffddf9d332d61"},"schema_version":"1.0","source":{"id":"1711.09148","kind":"arxiv","version":1}},"canonical_sha256":"1f2c9b036bbeb46187ffa6899dd1c36a069b8b299943b420f78cac889b8c2bc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f2c9b036bbeb46187ffa6899dd1c36a069b8b299943b420f78cac889b8c2bc6","first_computed_at":"2026-05-18T00:29:40.443986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:40.443986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U7wq95cM1OrMWNGc/Vf61IYV7Oow1YnxCThjY0m4OdDBuDqzxGA4gxzgGc7BgKMctjoyK7Sig9zJc0g7083uDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:40.444635Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.09148","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc5a840812bf666048ec263969aca27075b4d34e2dc4891d06bcb4b627c09438","sha256:6304a3aafd8e5c2a1e29f17474d2e49473a276f01bbc0c039ca7b61e37d91301"],"state_sha256":"e64d2986e32a77dc2290cbe71b5b3c08d7f7deb0f3b047c4a2e0d440bfad3a09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJ9ArA6fGc1nUdiKlVxfQxYNcxh+ZCu30PyAgBcuAizG6lBw03DmfuaXiCwyKeAliW+MKuAAcZr7t/9itEBcAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:32:04.573000Z","bundle_sha256":"6cfeeb0f431fb7da163a3ba8d4541d522962d997b64d8723dc02b38040058804"}}