{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GNRTWFQMCGANCDUZIZ5ZQGVH33","short_pith_number":"pith:GNRTWFQM","canonical_record":{"source":{"id":"1706.05161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-16T07:04:28Z","cross_cats_sorted":[],"title_canon_sha256":"40a96c1d7843e2b268d772bdf4a3f25db5e2c83d24b0227df6e59fd3916fb869","abstract_canon_sha256":"9be98898a3f5df0fa2af1152a1fc99e2933951605a4d0e5fa3185d2053eb3c6a"},"schema_version":"1.0"},"canonical_sha256":"33633b160c1180d10e99467b981aa7ded7866aaab242ac6891f1048557f90982","source":{"kind":"arxiv","id":"1706.05161","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05161","created_at":"2026-05-18T00:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05161v1","created_at":"2026-05-18T00:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05161","created_at":"2026-05-18T00:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"GNRTWFQMCGAN","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GNRTWFQMCGANCDUZ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GNRTWFQM","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GNRTWFQMCGANCDUZIZ5ZQGVH33","target":"record","payload":{"canonical_record":{"source":{"id":"1706.05161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-16T07:04:28Z","cross_cats_sorted":[],"title_canon_sha256":"40a96c1d7843e2b268d772bdf4a3f25db5e2c83d24b0227df6e59fd3916fb869","abstract_canon_sha256":"9be98898a3f5df0fa2af1152a1fc99e2933951605a4d0e5fa3185d2053eb3c6a"},"schema_version":"1.0"},"canonical_sha256":"33633b160c1180d10e99467b981aa7ded7866aaab242ac6891f1048557f90982","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:14.560525Z","signature_b64":"8+XFghu9McsrHpFdQVsuad1hChXkqM/M2DRLLPniA2rrFV4CoIU1un7Q+BUzgA/dt6hhxE3G3c7Q885GUkzGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33633b160c1180d10e99467b981aa7ded7866aaab242ac6891f1048557f90982","last_reissued_at":"2026-05-18T00:42:14.559884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:14.559884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.05161","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-18T00:42:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5fadBxZDmwU2s6LiJ/9lvgGq6U/86VG6zp17B16Y2iyrAkbUqe5G2zZ7JatbYLVzfmodO9xGi+EyvN3toacCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T05:14:52.138041Z"},"content_sha256":"833f1a5fbe74fc7e6f7c2c4c1139d999b1089f1c87e8a2d8cdf40630cb2b49df","schema_version":"1.0","event_id":"sha256:833f1a5fbe74fc7e6f7c2c4c1139d999b1089f1c87e8a2d8cdf40630cb2b49df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GNRTWFQMCGANCDUZIZ5ZQGVH33","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Results on Edge Partitions of 1-plane Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Emilio Di Giacomo, Fabrizio Montecchiani, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath, Walter Didimo, William S. Evans","submitted_at":"2017-06-16T07:04:28Z","abstract_excerpt":"A $1$-plane graph is a graph embedded in the plane such that each edge is crossed at most once. A NIC-plane graph is a $1$-plane graph such that any two pairs of crossing edges share at most one end-vertex. An edge partition of a $1$-plane graph $G$ is a coloring of the edges of $G$ with two colors, red and blue, such that both the graph induced by the red edges and the graph induced by the blue edges are plane graphs. We prove the following: $(i)$ Every NIC-plane graph admits an edge partition such that the red graph has maximum vertex degree three; this bound on the vertex degree is worst-ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05161","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-18T00:42:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N3vlweiuFrjB0ILi7gtgSjEqQjVJKouOG9MwABVGoeTw7MueJIIWlrtkqWqi1a/MxKVCZ6V4Ary1cWcRcPkLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T05:14:52.138772Z"},"content_sha256":"baf256283bed21c4a4b5a573d241888db9795062ce7816b7dd9279303679b429","schema_version":"1.0","event_id":"sha256:baf256283bed21c4a4b5a573d241888db9795062ce7816b7dd9279303679b429"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNRTWFQMCGANCDUZIZ5ZQGVH33/bundle.json","state_url":"https://pith.science/pith/GNRTWFQMCGANCDUZIZ5ZQGVH33/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNRTWFQMCGANCDUZIZ5ZQGVH33/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-22T05:14:52Z","links":{"resolver":"https://pith.science/pith/GNRTWFQMCGANCDUZIZ5ZQGVH33","bundle":"https://pith.science/pith/GNRTWFQMCGANCDUZIZ5ZQGVH33/bundle.json","state":"https://pith.science/pith/GNRTWFQMCGANCDUZIZ5ZQGVH33/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNRTWFQMCGANCDUZIZ5ZQGVH33/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GNRTWFQMCGANCDUZIZ5ZQGVH33","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":"9be98898a3f5df0fa2af1152a1fc99e2933951605a4d0e5fa3185d2053eb3c6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-16T07:04:28Z","title_canon_sha256":"40a96c1d7843e2b268d772bdf4a3f25db5e2c83d24b0227df6e59fd3916fb869"},"schema_version":"1.0","source":{"id":"1706.05161","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05161","created_at":"2026-05-18T00:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05161v1","created_at":"2026-05-18T00:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05161","created_at":"2026-05-18T00:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"GNRTWFQMCGAN","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GNRTWFQMCGANCDUZ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GNRTWFQM","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:baf256283bed21c4a4b5a573d241888db9795062ce7816b7dd9279303679b429","target":"graph","created_at":"2026-05-18T00:42:14Z","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":"A $1$-plane graph is a graph embedded in the plane such that each edge is crossed at most once. A NIC-plane graph is a $1$-plane graph such that any two pairs of crossing edges share at most one end-vertex. An edge partition of a $1$-plane graph $G$ is a coloring of the edges of $G$ with two colors, red and blue, such that both the graph induced by the red edges and the graph induced by the blue edges are plane graphs. We prove the following: $(i)$ Every NIC-plane graph admits an edge partition such that the red graph has maximum vertex degree three; this bound on the vertex degree is worst-ca","authors_text":"Emilio Di Giacomo, Fabrizio Montecchiani, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath, Walter Didimo, William S. Evans","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-16T07:04:28Z","title":"New Results on Edge Partitions of 1-plane Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05161","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:833f1a5fbe74fc7e6f7c2c4c1139d999b1089f1c87e8a2d8cdf40630cb2b49df","target":"record","created_at":"2026-05-18T00:42:14Z","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":"9be98898a3f5df0fa2af1152a1fc99e2933951605a4d0e5fa3185d2053eb3c6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-16T07:04:28Z","title_canon_sha256":"40a96c1d7843e2b268d772bdf4a3f25db5e2c83d24b0227df6e59fd3916fb869"},"schema_version":"1.0","source":{"id":"1706.05161","kind":"arxiv","version":1}},"canonical_sha256":"33633b160c1180d10e99467b981aa7ded7866aaab242ac6891f1048557f90982","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33633b160c1180d10e99467b981aa7ded7866aaab242ac6891f1048557f90982","first_computed_at":"2026-05-18T00:42:14.559884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:14.559884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8+XFghu9McsrHpFdQVsuad1hChXkqM/M2DRLLPniA2rrFV4CoIU1un7Q+BUzgA/dt6hhxE3G3c7Q885GUkzGAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:14.560525Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05161","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:833f1a5fbe74fc7e6f7c2c4c1139d999b1089f1c87e8a2d8cdf40630cb2b49df","sha256:baf256283bed21c4a4b5a573d241888db9795062ce7816b7dd9279303679b429"],"state_sha256":"5a12bc004bbe585fbf6d306a3315e5288900f0007868259362abd141d17e4529"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eu6OtNVW5YMx1rH+YDX5tTwyT25heTeEb48F+rY3mVVQblY01dHVjMcpu4KeKdxGKSllZ7zSB3xxu/ibffbgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T05:14:52.142768Z","bundle_sha256":"6441625f7ab7cc2d4b14425eef246090a54451d16b444048cd413ed1e93b6d11"}}