{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DTN3HCCPYJFX5MIT55MR667ILY","short_pith_number":"pith:DTN3HCCP","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"},"canonical_sha256":"1cdbb3884fc24b7eb113ef591f7be85e3b9485dbca2c5298e030b430d9654d6d","source":{"kind":"arxiv","id":"1501.05089","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05089","created_at":"2026-05-18T02:29:00Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05089v1","created_at":"2026-05-18T02:29:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05089","created_at":"2026-05-18T02:29:00Z"},{"alias_kind":"pith_short_12","alias_value":"DTN3HCCPYJFX","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DTN3HCCPYJFX5MIT","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DTN3HCCP","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DTN3HCCPYJFX5MIT55MR667ILY","target":"record","payload":{"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"},"canonical_sha256":"1cdbb3884fc24b7eb113ef591f7be85e3b9485dbca2c5298e030b430d9654d6d","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"},"source_kind":"arxiv","source_id":"1501.05089","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-18T02:29:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+FVNVVMilbvz1PZ5Res9ODjD7yqtUgMxHCu05YKFg1lFRwVOHaiyH9E9jUCwwTs9pzmUFfuXz5Kf3OH6dTPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:13:48.500655Z"},"content_sha256":"5b67b9e4663921d8a14b286e262377861f47231c6a7549985abcb8305c04118f","schema_version":"1.0","event_id":"sha256:5b67b9e4663921d8a14b286e262377861f47231c6a7549985abcb8305c04118f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DTN3HCCPYJFX5MIT55MR667ILY","target":"graph","payload":{"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"},"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:29:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AIz2wz2UiaDQenej2+eIFE2MUIXqFm1h21RlHmSIQjT0kQ05dVZiD2XtMc5PkkN4++byXDOD9VHG7kICgsbCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:13:48.501001Z"},"content_sha256":"0ba094795016752f1c73204ddeab05a21a4a9bc8c1af8d40b3d8330966197fed","schema_version":"1.0","event_id":"sha256:0ba094795016752f1c73204ddeab05a21a4a9bc8c1af8d40b3d8330966197fed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTN3HCCPYJFX5MIT55MR667ILY/bundle.json","state_url":"https://pith.science/pith/DTN3HCCPYJFX5MIT55MR667ILY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTN3HCCPYJFX5MIT55MR667ILY/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-06-03T09:13:48Z","links":{"resolver":"https://pith.science/pith/DTN3HCCPYJFX5MIT55MR667ILY","bundle":"https://pith.science/pith/DTN3HCCPYJFX5MIT55MR667ILY/bundle.json","state":"https://pith.science/pith/DTN3HCCPYJFX5MIT55MR667ILY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTN3HCCPYJFX5MIT55MR667ILY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DTN3HCCPYJFX5MIT55MR667ILY","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":"4f7ec03cd859b58ed7c7787deb60bfe31ed6a6892539ef4baff5cd55df5312d6","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-21T08:22:39Z","title_canon_sha256":"8363deceb3a925e43ab7e876c8113e7a06df1058c940262dce6113fc47ee69dc"},"schema_version":"1.0","source":{"id":"1501.05089","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05089","created_at":"2026-05-18T02:29:00Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05089v1","created_at":"2026-05-18T02:29:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05089","created_at":"2026-05-18T02:29:00Z"},{"alias_kind":"pith_short_12","alias_value":"DTN3HCCPYJFX","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DTN3HCCPYJFX5MIT","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DTN3HCCP","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:0ba094795016752f1c73204ddeab05a21a4a9bc8c1af8d40b3d8330966197fed","target":"graph","created_at":"2026-05-18T02:29:00Z","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":"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 ","authors_text":"Qiang Sun, Reza Naserasr, Sagnik Sen","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-21T08:22:39Z","title":"Walk-powers and homomorphism bound of planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05089","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:5b67b9e4663921d8a14b286e262377861f47231c6a7549985abcb8305c04118f","target":"record","created_at":"2026-05-18T02:29:00Z","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":"4f7ec03cd859b58ed7c7787deb60bfe31ed6a6892539ef4baff5cd55df5312d6","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-21T08:22:39Z","title_canon_sha256":"8363deceb3a925e43ab7e876c8113e7a06df1058c940262dce6113fc47ee69dc"},"schema_version":"1.0","source":{"id":"1501.05089","kind":"arxiv","version":1}},"canonical_sha256":"1cdbb3884fc24b7eb113ef591f7be85e3b9485dbca2c5298e030b430d9654d6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cdbb3884fc24b7eb113ef591f7be85e3b9485dbca2c5298e030b430d9654d6d","first_computed_at":"2026-05-18T02:29:00.776165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:00.776165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nYYtxhIdTlOmGa2UFE+MvNb53fZv7SyUtbQq1/tFZQ7AplE0g+2iLr3406gtJ+Hdf48IyLnHF40lLddHcJ8RDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:00.776566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05089","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b67b9e4663921d8a14b286e262377861f47231c6a7549985abcb8305c04118f","sha256:0ba094795016752f1c73204ddeab05a21a4a9bc8c1af8d40b3d8330966197fed"],"state_sha256":"bf1adf18c13b23ab5dbc862ca9c8d739992defbc02bbb5b87c45a34864a1852a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"acKZm+/g2gz+tVllxN133svAfQLZjhVw9Ee1YikqfdJAmpyeQZNFChXw6nBJdhrPuPySBEq4lJacGv7ptixIAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:13:48.502936Z","bundle_sha256":"0da4dbc84fc88be584d909afc2d9063f3f08a4f2167c05350d64c2f49143c0af"}}