{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5TPBVOXHQOUEWWWTCEYVAMFRDE","short_pith_number":"pith:5TPBVOXH","schema_version":"1.0","canonical_sha256":"ecde1abae783a84b5ad311315030b119348c762a8b138700cb536f488a0ead9f","source":{"kind":"arxiv","id":"1407.3175","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.3175","created_at":"2026-05-18T02:28:22.906225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.3175v2","created_at":"2026-05-18T02:28:22.906225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3175","created_at":"2026-05-18T02:28:22.906225+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TPBVOXHQOUE","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TPBVOXHQOUEWWWT","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TPBVOXH","created_at":"2026-05-18T12:28:16.859392+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5TPBVOXHQOUEWWWTCEYVAMFRDE","json":"https://pith.science/pith/5TPBVOXHQOUEWWWTCEYVAMFRDE.json","graph_json":"https://pith.science/api/pith-number/5TPBVOXHQOUEWWWTCEYVAMFRDE/graph.json","events_json":"https://pith.science/api/pith-number/5TPBVOXHQOUEWWWTCEYVAMFRDE/events.json","paper":"https://pith.science/paper/5TPBVOXH"},"agent_actions":{"view_html":"https://pith.science/pith/5TPBVOXHQOUEWWWTCEYVAMFRDE","download_json":"https://pith.science/pith/5TPBVOXHQOUEWWWTCEYVAMFRDE.json","view_paper":"https://pith.science/paper/5TPBVOXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.3175&json=true","fetch_graph":"https://pith.science/api/pith-number/5TPBVOXHQOUEWWWTCEYVAMFRDE/graph.json","fetch_events":"https://pith.science/api/pith-number/5TPBVOXHQOUEWWWTCEYVAMFRDE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TPBVOXHQOUEWWWTCEYVAMFRDE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TPBVOXHQOUEWWWTCEYVAMFRDE/action/storage_attestation","attest_author":"https://pith.science/pith/5TPBVOXHQOUEWWWTCEYVAMFRDE/action/author_attestation","sign_citation":"https://pith.science/pith/5TPBVOXHQOUEWWWTCEYVAMFRDE/action/citation_signature","submit_replication":"https://pith.science/pith/5TPBVOXHQOUEWWWTCEYVAMFRDE/action/replication_record"}},"created_at":"2026-05-18T02:28:22.906225+00:00","updated_at":"2026-05-18T02:28:22.906225+00:00"}