{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WKUAV6JDEWODKUEIZAXW2M3E2M","short_pith_number":"pith:WKUAV6JD","canonical_record":{"source":{"id":"2606.00533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-30T04:53:19Z","cross_cats_sorted":[],"title_canon_sha256":"2d714bd0bd25a71d70ceeb12ac2500e152d966b21457f7bb120c06b56fbaa975","abstract_canon_sha256":"e862e8024f0dc6ee436c16507ace747d5b7a42d477b2c5249e36b155b887c475"},"schema_version":"1.0"},"canonical_sha256":"b2a80af923259c355088c82f6d3364d33ff4575eb0bf093241c81e8c2bb205cf","source":{"kind":"arxiv","id":"2606.00533","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00533","created_at":"2026-06-02T01:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00533v1","created_at":"2026-06-02T01:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00533","created_at":"2026-06-02T01:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"WKUAV6JDEWOD","created_at":"2026-06-02T01:03:57Z"},{"alias_kind":"pith_short_16","alias_value":"WKUAV6JDEWODKUEI","created_at":"2026-06-02T01:03:57Z"},{"alias_kind":"pith_short_8","alias_value":"WKUAV6JD","created_at":"2026-06-02T01:03:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WKUAV6JDEWODKUEIZAXW2M3E2M","target":"record","payload":{"canonical_record":{"source":{"id":"2606.00533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-30T04:53:19Z","cross_cats_sorted":[],"title_canon_sha256":"2d714bd0bd25a71d70ceeb12ac2500e152d966b21457f7bb120c06b56fbaa975","abstract_canon_sha256":"e862e8024f0dc6ee436c16507ace747d5b7a42d477b2c5249e36b155b887c475"},"schema_version":"1.0"},"canonical_sha256":"b2a80af923259c355088c82f6d3364d33ff4575eb0bf093241c81e8c2bb205cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:57.371573Z","signature_b64":"zr0lnwfA9EMvzdNqWUFTbqQtaKyIACFERAyExrLffmvQAHeDuYoUK9RXo+z0/jen7lDQ5igNJYaMgPjVQGrLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2a80af923259c355088c82f6d3364d33ff4575eb0bf093241c81e8c2bb205cf","last_reissued_at":"2026-06-02T01:03:57.371053Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:57.371053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.00533","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-06-02T01:03:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cObr9CJeCmhys5hEnWPy87ahkBVMT7PXv0/fjC6DggddV5v9MhouEOZUhqa+kbP+RGXviO+tqul3vZz4ls7bAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:23:28.785533Z"},"content_sha256":"d4c099849552e45ebc271b30d417ab28285d1c91c04b767f78a5347bc60ed4d5","schema_version":"1.0","event_id":"sha256:d4c099849552e45ebc271b30d417ab28285d1c91c04b767f78a5347bc60ed4d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WKUAV6JDEWODKUEIZAXW2M3E2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The number of cut-edges and conflict-free connection number in planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dang Dinh Hanh, Pham Hoang Ha, Vu Quang Minh","submitted_at":"2026-05-30T04:53:19Z","abstract_excerpt":"A \\textit{cut-edge} of a connected graph is an edge whose deletion increases the number of components. In this paper, we first state some conditions for a planar graph to have a few cut-edges. After that, we use the main results to study the conditions for a colored planar graph to have a bounded conflict-free connection number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00533","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.00533/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-02T01:03:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DPnIrOLuwK5EsCnuW13cDjBfW5kWV6geyPH4tQss3B/8kB/2Q7pCN2FJjCib7oG7jEx2CRCnNOCcN8W7YF7kAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:23:28.785938Z"},"content_sha256":"661f9aa09899a5c6930088e7e6ff43be6c087300b2759bfc4072abaf9328f019","schema_version":"1.0","event_id":"sha256:661f9aa09899a5c6930088e7e6ff43be6c087300b2759bfc4072abaf9328f019"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WKUAV6JDEWODKUEIZAXW2M3E2M/bundle.json","state_url":"https://pith.science/pith/WKUAV6JDEWODKUEIZAXW2M3E2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WKUAV6JDEWODKUEIZAXW2M3E2M/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-24T13:23:28Z","links":{"resolver":"https://pith.science/pith/WKUAV6JDEWODKUEIZAXW2M3E2M","bundle":"https://pith.science/pith/WKUAV6JDEWODKUEIZAXW2M3E2M/bundle.json","state":"https://pith.science/pith/WKUAV6JDEWODKUEIZAXW2M3E2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WKUAV6JDEWODKUEIZAXW2M3E2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WKUAV6JDEWODKUEIZAXW2M3E2M","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":"e862e8024f0dc6ee436c16507ace747d5b7a42d477b2c5249e36b155b887c475","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-30T04:53:19Z","title_canon_sha256":"2d714bd0bd25a71d70ceeb12ac2500e152d966b21457f7bb120c06b56fbaa975"},"schema_version":"1.0","source":{"id":"2606.00533","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00533","created_at":"2026-06-02T01:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00533v1","created_at":"2026-06-02T01:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00533","created_at":"2026-06-02T01:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"WKUAV6JDEWOD","created_at":"2026-06-02T01:03:57Z"},{"alias_kind":"pith_short_16","alias_value":"WKUAV6JDEWODKUEI","created_at":"2026-06-02T01:03:57Z"},{"alias_kind":"pith_short_8","alias_value":"WKUAV6JD","created_at":"2026-06-02T01:03:57Z"}],"graph_snapshots":[{"event_id":"sha256:661f9aa09899a5c6930088e7e6ff43be6c087300b2759bfc4072abaf9328f019","target":"graph","created_at":"2026-06-02T01:03:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.00533/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A \\textit{cut-edge} of a connected graph is an edge whose deletion increases the number of components. In this paper, we first state some conditions for a planar graph to have a few cut-edges. After that, we use the main results to study the conditions for a colored planar graph to have a bounded conflict-free connection number.","authors_text":"Dang Dinh Hanh, Pham Hoang Ha, Vu Quang Minh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-30T04:53:19Z","title":"The number of cut-edges and conflict-free connection number in planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00533","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:d4c099849552e45ebc271b30d417ab28285d1c91c04b767f78a5347bc60ed4d5","target":"record","created_at":"2026-06-02T01:03:57Z","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":"e862e8024f0dc6ee436c16507ace747d5b7a42d477b2c5249e36b155b887c475","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-30T04:53:19Z","title_canon_sha256":"2d714bd0bd25a71d70ceeb12ac2500e152d966b21457f7bb120c06b56fbaa975"},"schema_version":"1.0","source":{"id":"2606.00533","kind":"arxiv","version":1}},"canonical_sha256":"b2a80af923259c355088c82f6d3364d33ff4575eb0bf093241c81e8c2bb205cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2a80af923259c355088c82f6d3364d33ff4575eb0bf093241c81e8c2bb205cf","first_computed_at":"2026-06-02T01:03:57.371053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:03:57.371053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zr0lnwfA9EMvzdNqWUFTbqQtaKyIACFERAyExrLffmvQAHeDuYoUK9RXo+z0/jen7lDQ5igNJYaMgPjVQGrLAA==","signature_status":"signed_v1","signed_at":"2026-06-02T01:03:57.371573Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.00533","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4c099849552e45ebc271b30d417ab28285d1c91c04b767f78a5347bc60ed4d5","sha256:661f9aa09899a5c6930088e7e6ff43be6c087300b2759bfc4072abaf9328f019"],"state_sha256":"918c26204b36e71c02d73e07254015b1fe182e247c0df37a11de63ec7fac30a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pj5oO++IycmmhFmOaohLFXAoHk+eC58/FDGkkLe9wCMpp5baEFqfpCWoXqGuzALEZsbhHCW2+FjzKCbr/XChDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T13:23:28.787972Z","bundle_sha256":"64099f095b51ff6fa127621a97ecab1caa4991a36e5fc84bb1ba8db9a95c1447"}}