{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5TPBVOXHQOUEWWWTCEYVAMFRDE","short_pith_number":"pith:5TPBVOXH","canonical_record":{"source":{"id":"1407.3175","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-07-11T14:40:31Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"023f33b3a1c0ff9600b4aeab491bb4db53a4b9b2bdb0ec965d87939fee3cbb55","abstract_canon_sha256":"68614f3657a52d9386b2f98aac5a81e9d21a0d293181df8deca9ff39e1fc9f73"},"schema_version":"1.0"},"canonical_sha256":"ecde1abae783a84b5ad311315030b119348c762a8b138700cb536f488a0ead9f","source":{"kind":"arxiv","id":"1407.3175","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3175","created_at":"2026-05-18T02:28:22Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3175v2","created_at":"2026-05-18T02:28:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3175","created_at":"2026-05-18T02:28:22Z"},{"alias_kind":"pith_short_12","alias_value":"5TPBVOXHQOUE","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5TPBVOXHQOUEWWWT","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5TPBVOXH","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5TPBVOXHQOUEWWWTCEYVAMFRDE","target":"record","payload":{"canonical_record":{"source":{"id":"1407.3175","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-07-11T14:40:31Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"023f33b3a1c0ff9600b4aeab491bb4db53a4b9b2bdb0ec965d87939fee3cbb55","abstract_canon_sha256":"68614f3657a52d9386b2f98aac5a81e9d21a0d293181df8deca9ff39e1fc9f73"},"schema_version":"1.0"},"canonical_sha256":"ecde1abae783a84b5ad311315030b119348c762a8b138700cb536f488a0ead9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:22.906696Z","signature_b64":"GcdAlzL3Bl+cJC4plxHdbeKPMCJjA2gjDe0ZOMbQpb13ZJE5s2b2steeqV4cmM5q54lg1mSzeD0w01+qCO6hAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecde1abae783a84b5ad311315030b119348c762a8b138700cb536f488a0ead9f","last_reissued_at":"2026-05-18T02:28:22.906121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:22.906121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.3175","source_version":2,"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-18T02:28:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5eLLvY+o7N/CJNmAlDZyWR96KiS0cYN5eNWyV6Hv0vpACPt+JNIQtZ+nzau7ymP/aPvuREmJUBaSAn288kxjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:05:48.370828Z"},"content_sha256":"011c1ac2720ee4ff3541a0fc9afc8b2b804de65a8231fd423ff10b5ae3064c9a","schema_version":"1.0","event_id":"sha256:011c1ac2720ee4ff3541a0fc9afc8b2b804de65a8231fd423ff10b5ae3064c9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5TPBVOXHQOUEWWWTCEYVAMFRDE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal covers, color refinement, and two-variable counting logic: Lower bounds for the depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LO","authors_text":"Andreas Krebs, Oleg Verbitsky","submitted_at":"2014-07-11T14:40:31Z","abstract_excerpt":"Given a connected graph $G$ and its vertex $x$, let $U_x(G)$ denote the universal cover of $G$ obtained by unfolding $G$ into a tree starting from $x$. Let $T=T(n)$ be the minimum number such that, for graphs $G$ and $H$ with at most $n$ vertices each, the isomorphism of $U_x(G)$ and $U_y(H)$ surely follows from the isomorphism of these rooted trees truncated at depth $T$. Motivated by applications in theory of distributed computing, Norris [Discrete Appl. Math. 1995] asks if $T(n)\\le n$. We answer this question in the negative by establishing that $T(n)=(2-o(1))n$. Our solution uses basic too"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3175","kind":"arxiv","version":2},"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-18T02:28:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N8Ma/5Myhy7m+d9TfR9MZ0vIk6ReKN4soc+7eJnfm0eSgbdkIQrA7JpPuhTzQUkA8bwAThM2zmksMwAIWGR2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:05:48.371431Z"},"content_sha256":"1118dd0c82bf052610fd410ef815e8d0c419363960f907274502127c8b096e10","schema_version":"1.0","event_id":"sha256:1118dd0c82bf052610fd410ef815e8d0c419363960f907274502127c8b096e10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TPBVOXHQOUEWWWTCEYVAMFRDE/bundle.json","state_url":"https://pith.science/pith/5TPBVOXHQOUEWWWTCEYVAMFRDE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TPBVOXHQOUEWWWTCEYVAMFRDE/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-25T10:05:48Z","links":{"resolver":"https://pith.science/pith/5TPBVOXHQOUEWWWTCEYVAMFRDE","bundle":"https://pith.science/pith/5TPBVOXHQOUEWWWTCEYVAMFRDE/bundle.json","state":"https://pith.science/pith/5TPBVOXHQOUEWWWTCEYVAMFRDE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TPBVOXHQOUEWWWTCEYVAMFRDE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5TPBVOXHQOUEWWWTCEYVAMFRDE","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":"68614f3657a52d9386b2f98aac5a81e9d21a0d293181df8deca9ff39e1fc9f73","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-07-11T14:40:31Z","title_canon_sha256":"023f33b3a1c0ff9600b4aeab491bb4db53a4b9b2bdb0ec965d87939fee3cbb55"},"schema_version":"1.0","source":{"id":"1407.3175","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3175","created_at":"2026-05-18T02:28:22Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3175v2","created_at":"2026-05-18T02:28:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3175","created_at":"2026-05-18T02:28:22Z"},{"alias_kind":"pith_short_12","alias_value":"5TPBVOXHQOUE","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5TPBVOXHQOUEWWWT","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5TPBVOXH","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:1118dd0c82bf052610fd410ef815e8d0c419363960f907274502127c8b096e10","target":"graph","created_at":"2026-05-18T02:28:22Z","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":"Given a connected graph $G$ and its vertex $x$, let $U_x(G)$ denote the universal cover of $G$ obtained by unfolding $G$ into a tree starting from $x$. Let $T=T(n)$ be the minimum number such that, for graphs $G$ and $H$ with at most $n$ vertices each, the isomorphism of $U_x(G)$ and $U_y(H)$ surely follows from the isomorphism of these rooted trees truncated at depth $T$. Motivated by applications in theory of distributed computing, Norris [Discrete Appl. Math. 1995] asks if $T(n)\\le n$. We answer this question in the negative by establishing that $T(n)=(2-o(1))n$. Our solution uses basic too","authors_text":"Andreas Krebs, Oleg Verbitsky","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-07-11T14:40:31Z","title":"Universal covers, color refinement, and two-variable counting logic: Lower bounds for the depth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3175","kind":"arxiv","version":2},"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:011c1ac2720ee4ff3541a0fc9afc8b2b804de65a8231fd423ff10b5ae3064c9a","target":"record","created_at":"2026-05-18T02:28:22Z","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":"68614f3657a52d9386b2f98aac5a81e9d21a0d293181df8deca9ff39e1fc9f73","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-07-11T14:40:31Z","title_canon_sha256":"023f33b3a1c0ff9600b4aeab491bb4db53a4b9b2bdb0ec965d87939fee3cbb55"},"schema_version":"1.0","source":{"id":"1407.3175","kind":"arxiv","version":2}},"canonical_sha256":"ecde1abae783a84b5ad311315030b119348c762a8b138700cb536f488a0ead9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecde1abae783a84b5ad311315030b119348c762a8b138700cb536f488a0ead9f","first_computed_at":"2026-05-18T02:28:22.906121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:22.906121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GcdAlzL3Bl+cJC4plxHdbeKPMCJjA2gjDe0ZOMbQpb13ZJE5s2b2steeqV4cmM5q54lg1mSzeD0w01+qCO6hAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:22.906696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.3175","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:011c1ac2720ee4ff3541a0fc9afc8b2b804de65a8231fd423ff10b5ae3064c9a","sha256:1118dd0c82bf052610fd410ef815e8d0c419363960f907274502127c8b096e10"],"state_sha256":"063372bdc01714de5eb4de759c3b16451affdff5d2f210f91f44c065f4c6c878"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sPWy+1EDiApu23JxtKib0yPjwDG4PzwMuITik0e3diBrRJokNUeNysvPEieB4+5c2BXMfA2vdNHhtr5lPNogDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:05:48.376443Z","bundle_sha256":"9df67e7b9d93454b2c1ca6e861fa5312258e254cca51a7bf6f7d2a01aeb0d61b"}}