{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BPPRLJZO3AD62DMJOFBNIKTRLI","short_pith_number":"pith:BPPRLJZO","canonical_record":{"source":{"id":"1403.1182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-05T16:33:57Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"151bc5367d84e1a9c3244274720c8b4033f55a66556fd0c2e9d2cac5d4e117b0","abstract_canon_sha256":"a401ffffa416a5f677631f9c3a0ccb9f42c59afb08a9e7031978bca9d4cdbaf5"},"schema_version":"1.0"},"canonical_sha256":"0bdf15a72ed807ed0d897142d42a715a1a442c770520433e6317df7379b743d4","source":{"kind":"arxiv","id":"1403.1182","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.1182","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"arxiv_version","alias_value":"1403.1182v1","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1182","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"pith_short_12","alias_value":"BPPRLJZO3AD6","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BPPRLJZO3AD62DMJ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BPPRLJZO","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BPPRLJZO3AD62DMJOFBNIKTRLI","target":"record","payload":{"canonical_record":{"source":{"id":"1403.1182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-05T16:33:57Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"151bc5367d84e1a9c3244274720c8b4033f55a66556fd0c2e9d2cac5d4e117b0","abstract_canon_sha256":"a401ffffa416a5f677631f9c3a0ccb9f42c59afb08a9e7031978bca9d4cdbaf5"},"schema_version":"1.0"},"canonical_sha256":"0bdf15a72ed807ed0d897142d42a715a1a442c770520433e6317df7379b743d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:22.671465Z","signature_b64":"KYRKeZdb3pCRMc1oSnGEFdXGaa5P/DUhgM23CdnVpPsOthmndobLUBbvHbn/17zRJJg7kWLI2VL+WjRykpcOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bdf15a72ed807ed0d897142d42a715a1a442c770520433e6317df7379b743d4","last_reissued_at":"2026-05-18T02:50:22.670831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:22.670831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.1182","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:50:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ksI/Xpwxvhjk2vpSTXuH635mMuQa8cNPSUtDqATI+uxA56XLyPHQCZ6fiBNY5+DtrmyjdTcx2bqz7AFAm67Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:22:29.650951Z"},"content_sha256":"50c96233a1bce9c2dee3db7dcbde7bd30e62ee183bd519ea959a019d2ff5184c","schema_version":"1.0","event_id":"sha256:50c96233a1bce9c2dee3db7dcbde7bd30e62ee183bd519ea959a019d2ff5184c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BPPRLJZO3AD62DMJOFBNIKTRLI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the complexity of deciding whether the regular number is at most two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Ali Dehghan, Arash Ahadi, Mohammad-Reza Sadeghi","submitted_at":"2014-03-05T16:33:57Z","abstract_excerpt":"The regular number of a graph G denoted by reg(G) is the minimum number of subsets into which the edge set of G can be partitioned so that the subgraph induced by each subset is regular. In this work we answer to the problem posed as an open problem in A. Ganesan et al. (2012) [3] about the complexity of determining the regular number of graphs. We show that computation of the regular number for connected bipartite graphs is NP-hard. Furthermore, we show that, determining whether reg(G) = 2 for a given connected 3-colorable graph G is NP-complete. Also, we prove that a new variant of the Monot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1182","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:50:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qslik6Erb80A5qIrsEy62XycEnJqHHL9MAtZhbLzs8wheYJjcCGo9I8B5ulDH6E5Q0s+SxC6l6V/sRvND3heBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:22:29.651296Z"},"content_sha256":"98b61289b015458497f84e4b38d1599bd7ea8dde219338982fb143b5659ff501","schema_version":"1.0","event_id":"sha256:98b61289b015458497f84e4b38d1599bd7ea8dde219338982fb143b5659ff501"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BPPRLJZO3AD62DMJOFBNIKTRLI/bundle.json","state_url":"https://pith.science/pith/BPPRLJZO3AD62DMJOFBNIKTRLI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BPPRLJZO3AD62DMJOFBNIKTRLI/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-01T10:22:29Z","links":{"resolver":"https://pith.science/pith/BPPRLJZO3AD62DMJOFBNIKTRLI","bundle":"https://pith.science/pith/BPPRLJZO3AD62DMJOFBNIKTRLI/bundle.json","state":"https://pith.science/pith/BPPRLJZO3AD62DMJOFBNIKTRLI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BPPRLJZO3AD62DMJOFBNIKTRLI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BPPRLJZO3AD62DMJOFBNIKTRLI","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":"a401ffffa416a5f677631f9c3a0ccb9f42c59afb08a9e7031978bca9d4cdbaf5","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-05T16:33:57Z","title_canon_sha256":"151bc5367d84e1a9c3244274720c8b4033f55a66556fd0c2e9d2cac5d4e117b0"},"schema_version":"1.0","source":{"id":"1403.1182","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.1182","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"arxiv_version","alias_value":"1403.1182v1","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1182","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"pith_short_12","alias_value":"BPPRLJZO3AD6","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BPPRLJZO3AD62DMJ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BPPRLJZO","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:98b61289b015458497f84e4b38d1599bd7ea8dde219338982fb143b5659ff501","target":"graph","created_at":"2026-05-18T02:50:22Z","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":"The regular number of a graph G denoted by reg(G) is the minimum number of subsets into which the edge set of G can be partitioned so that the subgraph induced by each subset is regular. In this work we answer to the problem posed as an open problem in A. Ganesan et al. (2012) [3] about the complexity of determining the regular number of graphs. We show that computation of the regular number for connected bipartite graphs is NP-hard. Furthermore, we show that, determining whether reg(G) = 2 for a given connected 3-colorable graph G is NP-complete. Also, we prove that a new variant of the Monot","authors_text":"Ali Dehghan, Arash Ahadi, Mohammad-Reza Sadeghi","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-05T16:33:57Z","title":"On the complexity of deciding whether the regular number is at most two"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1182","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:50c96233a1bce9c2dee3db7dcbde7bd30e62ee183bd519ea959a019d2ff5184c","target":"record","created_at":"2026-05-18T02:50:22Z","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":"a401ffffa416a5f677631f9c3a0ccb9f42c59afb08a9e7031978bca9d4cdbaf5","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-05T16:33:57Z","title_canon_sha256":"151bc5367d84e1a9c3244274720c8b4033f55a66556fd0c2e9d2cac5d4e117b0"},"schema_version":"1.0","source":{"id":"1403.1182","kind":"arxiv","version":1}},"canonical_sha256":"0bdf15a72ed807ed0d897142d42a715a1a442c770520433e6317df7379b743d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bdf15a72ed807ed0d897142d42a715a1a442c770520433e6317df7379b743d4","first_computed_at":"2026-05-18T02:50:22.670831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:22.670831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KYRKeZdb3pCRMc1oSnGEFdXGaa5P/DUhgM23CdnVpPsOthmndobLUBbvHbn/17zRJJg7kWLI2VL+WjRykpcOBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:22.671465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.1182","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50c96233a1bce9c2dee3db7dcbde7bd30e62ee183bd519ea959a019d2ff5184c","sha256:98b61289b015458497f84e4b38d1599bd7ea8dde219338982fb143b5659ff501"],"state_sha256":"60a6eb0b85332887ebbda58b64121e7ae6c406fa9ff6ffaccab7ad202cdf4362"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IWe7BuTp/xiPoFixgMMrCV71L0zHnk8Vc/P1+w9utbxZU1e3NALrf0TcWAbRZ+C97tfqCwpV5oOKvnJaLpK2Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:22:29.653431Z","bundle_sha256":"39e8c1d951708f04ac68fae725a4b947f598e7df39582058d37876b7a9f23f00"}}