{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:V7WCPKMKCUSBBMPZ4ZSBN4VVXR","short_pith_number":"pith:V7WCPKMK","canonical_record":{"source":{"id":"1506.03151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-10T02:43:32Z","cross_cats_sorted":[],"title_canon_sha256":"18f66891e00ceb5960dcbf91c3ad48b31e7e67ca6464721f54d870b6b81810eb","abstract_canon_sha256":"0203093e9f5b677cdfc1eb3f6a5910c2e62a4ea74063877197025fbcf66dc0cc"},"schema_version":"1.0"},"canonical_sha256":"afec27a98a152410b1f9e66416f2b5bc4fb92c18345b19e01aadb1e8093b52bc","source":{"kind":"arxiv","id":"1506.03151","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03151","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03151v1","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03151","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"pith_short_12","alias_value":"V7WCPKMKCUSB","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V7WCPKMKCUSBBMPZ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V7WCPKMK","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:V7WCPKMKCUSBBMPZ4ZSBN4VVXR","target":"record","payload":{"canonical_record":{"source":{"id":"1506.03151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-10T02:43:32Z","cross_cats_sorted":[],"title_canon_sha256":"18f66891e00ceb5960dcbf91c3ad48b31e7e67ca6464721f54d870b6b81810eb","abstract_canon_sha256":"0203093e9f5b677cdfc1eb3f6a5910c2e62a4ea74063877197025fbcf66dc0cc"},"schema_version":"1.0"},"canonical_sha256":"afec27a98a152410b1f9e66416f2b5bc4fb92c18345b19e01aadb1e8093b52bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:31.391055Z","signature_b64":"vxrDujq5XG9DCz3Cm1yp6jaiIDJ/da3A24rrMCnlgN00f+ynNV6tuuBa9Kr67p/n12yo0HeZNF/xw9+JvWX3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afec27a98a152410b1f9e66416f2b5bc4fb92c18345b19e01aadb1e8093b52bc","last_reissued_at":"2026-05-18T01:55:31.390472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:31.390472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.03151","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-18T01:55:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7LY/OrO+Rt4zuIoTkAMsFJJrIjq2tUbFumPHSeM55bGBwAAYWSXVH6d8/9RlGiUDaI2CopN8saL9vowf1aONBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:02:53.555427Z"},"content_sha256":"414d37022564e9e75cca55e1083becbd35f0216613f1885ceef3a88215a6c171","schema_version":"1.0","event_id":"sha256:414d37022564e9e75cca55e1083becbd35f0216613f1885ceef3a88215a6c171"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:V7WCPKMKCUSBBMPZ4ZSBN4VVXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$k$-intersection edge-coloring subcubic planar multigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"M. Santana","submitted_at":"2015-06-10T02:43:32Z","abstract_excerpt":"Given an edge-coloring of a simple graph, assign to every vertex $v$ a set $S_v$ comprised of the colors used on the edges incident to $v$. The $k$-intersection chromatic index of a graph is the minimum $t$ such that the edge set can be properly $t$-colored, additionally requiring that for every two adjacent vertices $u$ and $v$, $|S_u \\cap S_v| \\le k$. For all $k \\neq 2$, this value is known for subcubic planar graphs, and furthermore, these values are best possible. We naturally extend this definition to multigraphs with bounded edge multiplicity, and we show that every subcubic planar multi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03151","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-18T01:55:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IkylCbE3B+hUc3sCFAfJXa5xBt9oU6eBPQEAVwfXuxnaPIWXxEq3Yk8dVUWiy0WU3dB+8tCraVF5aK9rAUxzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:02:53.555901Z"},"content_sha256":"a51cbc23eda663594cb5970c33ac8b444823b9ee3a1b55bde64f4125041d5d3e","schema_version":"1.0","event_id":"sha256:a51cbc23eda663594cb5970c33ac8b444823b9ee3a1b55bde64f4125041d5d3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V7WCPKMKCUSBBMPZ4ZSBN4VVXR/bundle.json","state_url":"https://pith.science/pith/V7WCPKMKCUSBBMPZ4ZSBN4VVXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V7WCPKMKCUSBBMPZ4ZSBN4VVXR/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-27T11:02:53Z","links":{"resolver":"https://pith.science/pith/V7WCPKMKCUSBBMPZ4ZSBN4VVXR","bundle":"https://pith.science/pith/V7WCPKMKCUSBBMPZ4ZSBN4VVXR/bundle.json","state":"https://pith.science/pith/V7WCPKMKCUSBBMPZ4ZSBN4VVXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V7WCPKMKCUSBBMPZ4ZSBN4VVXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:V7WCPKMKCUSBBMPZ4ZSBN4VVXR","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":"0203093e9f5b677cdfc1eb3f6a5910c2e62a4ea74063877197025fbcf66dc0cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-10T02:43:32Z","title_canon_sha256":"18f66891e00ceb5960dcbf91c3ad48b31e7e67ca6464721f54d870b6b81810eb"},"schema_version":"1.0","source":{"id":"1506.03151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03151","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03151v1","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03151","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"pith_short_12","alias_value":"V7WCPKMKCUSB","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V7WCPKMKCUSBBMPZ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V7WCPKMK","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:a51cbc23eda663594cb5970c33ac8b444823b9ee3a1b55bde64f4125041d5d3e","target":"graph","created_at":"2026-05-18T01:55:31Z","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 an edge-coloring of a simple graph, assign to every vertex $v$ a set $S_v$ comprised of the colors used on the edges incident to $v$. The $k$-intersection chromatic index of a graph is the minimum $t$ such that the edge set can be properly $t$-colored, additionally requiring that for every two adjacent vertices $u$ and $v$, $|S_u \\cap S_v| \\le k$. For all $k \\neq 2$, this value is known for subcubic planar graphs, and furthermore, these values are best possible. We naturally extend this definition to multigraphs with bounded edge multiplicity, and we show that every subcubic planar multi","authors_text":"M. Santana","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-10T02:43:32Z","title":"$k$-intersection edge-coloring subcubic planar multigraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03151","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:414d37022564e9e75cca55e1083becbd35f0216613f1885ceef3a88215a6c171","target":"record","created_at":"2026-05-18T01:55:31Z","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":"0203093e9f5b677cdfc1eb3f6a5910c2e62a4ea74063877197025fbcf66dc0cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-10T02:43:32Z","title_canon_sha256":"18f66891e00ceb5960dcbf91c3ad48b31e7e67ca6464721f54d870b6b81810eb"},"schema_version":"1.0","source":{"id":"1506.03151","kind":"arxiv","version":1}},"canonical_sha256":"afec27a98a152410b1f9e66416f2b5bc4fb92c18345b19e01aadb1e8093b52bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afec27a98a152410b1f9e66416f2b5bc4fb92c18345b19e01aadb1e8093b52bc","first_computed_at":"2026-05-18T01:55:31.390472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:31.390472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vxrDujq5XG9DCz3Cm1yp6jaiIDJ/da3A24rrMCnlgN00f+ynNV6tuuBa9Kr67p/n12yo0HeZNF/xw9+JvWX3DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:31.391055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.03151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:414d37022564e9e75cca55e1083becbd35f0216613f1885ceef3a88215a6c171","sha256:a51cbc23eda663594cb5970c33ac8b444823b9ee3a1b55bde64f4125041d5d3e"],"state_sha256":"5e8a0f048dc9f9cd0b23890100c5949f5d1290e4952be1cd01128638a962cdfb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bxnM7TngbB/cbIfy+Hn/CLXqPXFrpeplQMl1qKkN+biNSRtqnY5/oHzZRX0zYl591CoXU1RpgSwsPlK3CeAOCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:02:53.559311Z","bundle_sha256":"5a788141bead25ac885640f308311cdd1352e8a2eb543eb7b4b8ba4bd55b4e41"}}