{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4IP2TAQ47UXNY77USSNPMZXVED","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":"9d88b9eca756987e744471cded852388fde93e5aff53bf3623e08d26a11f416b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-20T22:01:22Z","title_canon_sha256":"ba0dbeda8d130d93aae7b5a0e3d563aa896ed5e98eb1fe3431a3e3a7697c4621"},"schema_version":"1.0","source":{"id":"1701.05934","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05934","created_at":"2026-05-18T00:52:19Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05934v1","created_at":"2026-05-18T00:52:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05934","created_at":"2026-05-18T00:52:19Z"},{"alias_kind":"pith_short_12","alias_value":"4IP2TAQ47UXN","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4IP2TAQ47UXNY77U","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4IP2TAQ4","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:0249455965c412c26fc51837ddb34e39c1be3682e72cc460b036043a6c7f9772","target":"graph","created_at":"2026-05-18T00:52:19Z","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 graph $G$ is {\\it weakly semiregular} if there are two numbers $a,b$, such that the degree of every vertex is $a$ or $b$. The {\\it weakly semiregular number} of a graph $G$, denoted by $wr(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 a weakly semiregular graph. We present a polynomial time algorithm to determine whether the weakly semiregular number of a given tree is two. On the other hand, we show that determining whether $ wr(G) = 2 $ for a given bipartite graph $ G $ with at most three numbers in it","authors_text":"Ali Dehghan, Arash Ahadi, Mohsen Mollahajiaghaei","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-20T22:01:22Z","title":"Algorithmic Complexity of Weakly Semiregular Partitioning and the Representation Number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05934","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:2a603baed574ebc3543c57113a0db0c82f32e75022cdc66bd76b67b3cca1813a","target":"record","created_at":"2026-05-18T00:52:19Z","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":"9d88b9eca756987e744471cded852388fde93e5aff53bf3623e08d26a11f416b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-20T22:01:22Z","title_canon_sha256":"ba0dbeda8d130d93aae7b5a0e3d563aa896ed5e98eb1fe3431a3e3a7697c4621"},"schema_version":"1.0","source":{"id":"1701.05934","kind":"arxiv","version":1}},"canonical_sha256":"e21fa9821cfd2edc7ff4949af666f520d2c61473ba94c7e3155664c2f1a2bf5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e21fa9821cfd2edc7ff4949af666f520d2c61473ba94c7e3155664c2f1a2bf5e","first_computed_at":"2026-05-18T00:52:19.810141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:19.810141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CNHuDbFiCd/iksEpEjI9MyiTNmiVPnDaHbmPGqqWN0laeTcbAJksZjlGYie+EmdHn77MaQOYZF8R0QSA/Pm+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:19.810818Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05934","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a603baed574ebc3543c57113a0db0c82f32e75022cdc66bd76b67b3cca1813a","sha256:0249455965c412c26fc51837ddb34e39c1be3682e72cc460b036043a6c7f9772"],"state_sha256":"cf47ed15230a4a136ad47e934fd75ead842275a89eb292819ff027db649261e7"}