{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DTN3HCCPYJFX5MIT55MR667ILY","short_pith_number":"pith:DTN3HCCP","schema_version":"1.0","canonical_sha256":"1cdbb3884fc24b7eb113ef591f7be85e3b9485dbca2c5298e030b430d9654d6d","source":{"kind":"arxiv","id":"1501.05089","version":1},"attestation_state":"computed","paper":{"title":"Walk-powers and homomorphism bound of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Qiang Sun, Reza Naserasr, Sagnik Sen","submitted_at":"2015-01-21T08:22:39Z","abstract_excerpt":"As an extension of the Four-Color Theorem it is conjectured that every planar graph of odd-girth at least $2k+1$ admits a homomorphism to $PC_{2k}=(\\mathbb{Z}_2^{2k}, \\{e_1, e_2, ...,e_{2k}, J\\})$ where $e_i$'s are standard basis and $J$ is all 1 vector. Noting that $PC_{2k}$ itself is of odd-girth $2k+1$, in this work we show that if the conjecture is true, then $PC_{2k}$ is an optimal such a graph both with respect to number of vertices and number of edges. The result is obtained using the notion of walk-power of graphs and their clique numbers.\n  An analogous result is proved for bipartite "},"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":"1501.05089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-21T08:22:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8363deceb3a925e43ab7e876c8113e7a06df1058c940262dce6113fc47ee69dc","abstract_canon_sha256":"4f7ec03cd859b58ed7c7787deb60bfe31ed6a6892539ef4baff5cd55df5312d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:00.776566Z","signature_b64":"nYYtxhIdTlOmGa2UFE+MvNb53fZv7SyUtbQq1/tFZQ7AplE0g+2iLr3406gtJ+Hdf48IyLnHF40lLddHcJ8RDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cdbb3884fc24b7eb113ef591f7be85e3b9485dbca2c5298e030b430d9654d6d","last_reissued_at":"2026-05-18T02:29:00.776165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:00.776165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Walk-powers and homomorphism bound of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Qiang Sun, Reza Naserasr, Sagnik Sen","submitted_at":"2015-01-21T08:22:39Z","abstract_excerpt":"As an extension of the Four-Color Theorem it is conjectured that every planar graph of odd-girth at least $2k+1$ admits a homomorphism to $PC_{2k}=(\\mathbb{Z}_2^{2k}, \\{e_1, e_2, ...,e_{2k}, J\\})$ where $e_i$'s are standard basis and $J$ is all 1 vector. Noting that $PC_{2k}$ itself is of odd-girth $2k+1$, in this work we show that if the conjecture is true, then $PC_{2k}$ is an optimal such a graph both with respect to number of vertices and number of edges. The result is obtained using the notion of walk-power of graphs and their clique numbers.\n  An analogous result is proved for bipartite "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05089","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.05089","created_at":"2026-05-18T02:29:00.776230+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.05089v1","created_at":"2026-05-18T02:29:00.776230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05089","created_at":"2026-05-18T02:29:00.776230+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTN3HCCPYJFX","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTN3HCCPYJFX5MIT","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTN3HCCP","created_at":"2026-05-18T12:29:17.054201+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/DTN3HCCPYJFX5MIT55MR667ILY","json":"https://pith.science/pith/DTN3HCCPYJFX5MIT55MR667ILY.json","graph_json":"https://pith.science/api/pith-number/DTN3HCCPYJFX5MIT55MR667ILY/graph.json","events_json":"https://pith.science/api/pith-number/DTN3HCCPYJFX5MIT55MR667ILY/events.json","paper":"https://pith.science/paper/DTN3HCCP"},"agent_actions":{"view_html":"https://pith.science/pith/DTN3HCCPYJFX5MIT55MR667ILY","download_json":"https://pith.science/pith/DTN3HCCPYJFX5MIT55MR667ILY.json","view_paper":"https://pith.science/paper/DTN3HCCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.05089&json=true","fetch_graph":"https://pith.science/api/pith-number/DTN3HCCPYJFX5MIT55MR667ILY/graph.json","fetch_events":"https://pith.science/api/pith-number/DTN3HCCPYJFX5MIT55MR667ILY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTN3HCCPYJFX5MIT55MR667ILY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTN3HCCPYJFX5MIT55MR667ILY/action/storage_attestation","attest_author":"https://pith.science/pith/DTN3HCCPYJFX5MIT55MR667ILY/action/author_attestation","sign_citation":"https://pith.science/pith/DTN3HCCPYJFX5MIT55MR667ILY/action/citation_signature","submit_replication":"https://pith.science/pith/DTN3HCCPYJFX5MIT55MR667ILY/action/replication_record"}},"created_at":"2026-05-18T02:29:00.776230+00:00","updated_at":"2026-05-18T02:29:00.776230+00:00"}