{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RVGIAZLX7JYPLJQXCTU3JTBAMH","short_pith_number":"pith:RVGIAZLX","canonical_record":{"source":{"id":"1505.04908","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-19T08:39:51Z","cross_cats_sorted":[],"title_canon_sha256":"5fd5be44ecb6dc35fcfbc44da5088b4f1ded5c08d3d5171ea3069fbe5cc20359","abstract_canon_sha256":"0ff697c1f1d51eca9d9fbc7acd02e3281d5da5c8a56379dd541c2d255048df6d"},"schema_version":"1.0"},"canonical_sha256":"8d4c806577fa70f5a61714e9b4cc2061c2e9a51364ecec1bf2c8c72061343a34","source":{"kind":"arxiv","id":"1505.04908","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04908","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04908v3","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04908","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"RVGIAZLX7JYP","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RVGIAZLX7JYPLJQX","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RVGIAZLX","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RVGIAZLX7JYPLJQXCTU3JTBAMH","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04908","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-19T08:39:51Z","cross_cats_sorted":[],"title_canon_sha256":"5fd5be44ecb6dc35fcfbc44da5088b4f1ded5c08d3d5171ea3069fbe5cc20359","abstract_canon_sha256":"0ff697c1f1d51eca9d9fbc7acd02e3281d5da5c8a56379dd541c2d255048df6d"},"schema_version":"1.0"},"canonical_sha256":"8d4c806577fa70f5a61714e9b4cc2061c2e9a51364ecec1bf2c8c72061343a34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:46.913765Z","signature_b64":"StRxHyrD8al2sa3t6iG0B/ib6rsjVkHlguMCJo75GTFKNJydyQQJz4213yXL+Kg/PcK8QFGjQtgcfvpljm/LAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d4c806577fa70f5a61714e9b4cc2061c2e9a51364ecec1bf2c8c72061343a34","last_reissued_at":"2026-05-18T01:09:46.913127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:46.913127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04908","source_version":3,"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-18T01:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N/nP1wbuXqK/kNa3E/tuZCr3nr0m5GDxcI8J8Gd90uqCgZSS18n7BEsrkG9w8x+89SRN523twitRbJ4K79hYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:49:23.885271Z"},"content_sha256":"d8afcdd180f49d346d882489c6aea3ec1b8c89a47a9cc101ac6d6dca5cb5d57c","schema_version":"1.0","event_id":"sha256:d8afcdd180f49d346d882489c6aea3ec1b8c89a47a9cc101ac6d6dca5cb5d57c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RVGIAZLX7JYPLJQXCTU3JTBAMH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On incidence coloring conjecture in Cartesian products of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Borut Lu\\v{z}ar, Petr Gregor, Roman Sot\\'ak","submitted_at":"2015-05-19T08:39:51Z","abstract_excerpt":"An incidence in a graph $G$ is a pair $(v,e)$ where $v$ is a vertex of $G$ and $e$ is an edge of $G$ incident to $v$. Two incidences $(v,e)$ and $(u,f)$ are adjacent if at least one of the following holds: $(a)$ $v = u$, $(b)$ $e = f$, or $(c)$ $vu \\in \\{e,f\\}$. An incidence coloring of $G$ is a coloring of its incidences assigning distinct colors to adjacent incidences. It was conjectured that at most $\\Delta(G) + 2$ colors are needed for an incidence coloring of any graph $G$. The conjecture is false in general, but the bound holds for many classes of graphs. We introduce some sufficient pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04908","kind":"arxiv","version":3},"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-18T01:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zgu8XMd2c6NUQamwu1mB4Glf9DRPHhfNaZzXjXdPY8lN4s+tfDdszbljI+d0g9cifdh2Xq2DCh9twGWJp4KJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:49:23.885722Z"},"content_sha256":"070feeeff3d94b8baecf0fa6873dd6d104a2961aaf06a91320eb9a085122a287","schema_version":"1.0","event_id":"sha256:070feeeff3d94b8baecf0fa6873dd6d104a2961aaf06a91320eb9a085122a287"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RVGIAZLX7JYPLJQXCTU3JTBAMH/bundle.json","state_url":"https://pith.science/pith/RVGIAZLX7JYPLJQXCTU3JTBAMH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RVGIAZLX7JYPLJQXCTU3JTBAMH/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-27T20:49:23Z","links":{"resolver":"https://pith.science/pith/RVGIAZLX7JYPLJQXCTU3JTBAMH","bundle":"https://pith.science/pith/RVGIAZLX7JYPLJQXCTU3JTBAMH/bundle.json","state":"https://pith.science/pith/RVGIAZLX7JYPLJQXCTU3JTBAMH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RVGIAZLX7JYPLJQXCTU3JTBAMH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RVGIAZLX7JYPLJQXCTU3JTBAMH","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":"0ff697c1f1d51eca9d9fbc7acd02e3281d5da5c8a56379dd541c2d255048df6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-19T08:39:51Z","title_canon_sha256":"5fd5be44ecb6dc35fcfbc44da5088b4f1ded5c08d3d5171ea3069fbe5cc20359"},"schema_version":"1.0","source":{"id":"1505.04908","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04908","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04908v3","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04908","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"RVGIAZLX7JYP","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RVGIAZLX7JYPLJQX","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RVGIAZLX","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:070feeeff3d94b8baecf0fa6873dd6d104a2961aaf06a91320eb9a085122a287","target":"graph","created_at":"2026-05-18T01:09:46Z","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":"An incidence in a graph $G$ is a pair $(v,e)$ where $v$ is a vertex of $G$ and $e$ is an edge of $G$ incident to $v$. Two incidences $(v,e)$ and $(u,f)$ are adjacent if at least one of the following holds: $(a)$ $v = u$, $(b)$ $e = f$, or $(c)$ $vu \\in \\{e,f\\}$. An incidence coloring of $G$ is a coloring of its incidences assigning distinct colors to adjacent incidences. It was conjectured that at most $\\Delta(G) + 2$ colors are needed for an incidence coloring of any graph $G$. The conjecture is false in general, but the bound holds for many classes of graphs. We introduce some sufficient pro","authors_text":"Borut Lu\\v{z}ar, Petr Gregor, Roman Sot\\'ak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-19T08:39:51Z","title":"On incidence coloring conjecture in Cartesian products of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04908","kind":"arxiv","version":3},"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:d8afcdd180f49d346d882489c6aea3ec1b8c89a47a9cc101ac6d6dca5cb5d57c","target":"record","created_at":"2026-05-18T01:09:46Z","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":"0ff697c1f1d51eca9d9fbc7acd02e3281d5da5c8a56379dd541c2d255048df6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-19T08:39:51Z","title_canon_sha256":"5fd5be44ecb6dc35fcfbc44da5088b4f1ded5c08d3d5171ea3069fbe5cc20359"},"schema_version":"1.0","source":{"id":"1505.04908","kind":"arxiv","version":3}},"canonical_sha256":"8d4c806577fa70f5a61714e9b4cc2061c2e9a51364ecec1bf2c8c72061343a34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d4c806577fa70f5a61714e9b4cc2061c2e9a51364ecec1bf2c8c72061343a34","first_computed_at":"2026-05-18T01:09:46.913127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:46.913127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"StRxHyrD8al2sa3t6iG0B/ib6rsjVkHlguMCJo75GTFKNJydyQQJz4213yXL+Kg/PcK8QFGjQtgcfvpljm/LAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:46.913765Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04908","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8afcdd180f49d346d882489c6aea3ec1b8c89a47a9cc101ac6d6dca5cb5d57c","sha256:070feeeff3d94b8baecf0fa6873dd6d104a2961aaf06a91320eb9a085122a287"],"state_sha256":"d7bf5a8e9e1f5bfcb75bbb67c1811e3a248ea1c504c3eefa98b53066e4774350"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F3//+H68Az+3H0sxd45FaEAwWY6lseuNJab6oMkwYMt/2TbHbVVw367A2ydTXofNHnbyYwO4FGfuE36y/UXEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:49:23.888001Z","bundle_sha256":"1d59d72098f016470bce226e3f7d46f216209e2c5d8a4db772db08b7409956c3"}}