{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UTCDNEIDEOCP3UKTMRUSASTDZK","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":"2d4c461ce4a6544aab3c5ae24718ed2fcacd41d2c61884e0783a3dcc26ef2315","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-05T17:02:05Z","title_canon_sha256":"3868bba4d162c071e70df7bd4b6df9a6ac0b1462c6060faa458fdd3dd0d2d9ed"},"schema_version":"1.0","source":{"id":"1508.01129","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01129","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01129v1","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01129","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"pith_short_12","alias_value":"UTCDNEIDEOCP","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UTCDNEIDEOCP3UKT","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UTCDNEID","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:e87c965018b70b0fe16157b8e0b40d183b942bbb25f2f5a55b9fddcf98e3177e","target":"graph","created_at":"2026-05-18T00:49:47Z","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 \\emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which induces a locally irregular subgraph in $G$. It has been conjectured that apart from the family of exceptions which admit no such decompositions, i.e., odd paths, odd cycles and a special class of graphs of maximum degree $3$, every connected graph can be decomposed into $3$ locally irregular subgraphs. Using a combination of a probabilistic approach and some kn","authors_text":"Jakub Przyby{\\l}o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-05T17:02:05Z","title":"On decomposing graphs of large minimum degree into locally irregular subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01129","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:925ab6277ce45a36b5ce32ee7d6d0eb63a72a3dbd71cfdef55c6a7fb50e9262b","target":"record","created_at":"2026-05-18T00:49:47Z","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":"2d4c461ce4a6544aab3c5ae24718ed2fcacd41d2c61884e0783a3dcc26ef2315","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-05T17:02:05Z","title_canon_sha256":"3868bba4d162c071e70df7bd4b6df9a6ac0b1462c6060faa458fdd3dd0d2d9ed"},"schema_version":"1.0","source":{"id":"1508.01129","kind":"arxiv","version":1}},"canonical_sha256":"a4c43691032384fdd1536469204a63cab918d0ef301d82f05319ed079879019b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4c43691032384fdd1536469204a63cab918d0ef301d82f05319ed079879019b","first_computed_at":"2026-05-18T00:49:47.287289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:47.287289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zqlZ/46COgh4s3HDTQvgXXmGMPOovsTBz8zGRm+XWnQ/LJmdDFzJfcpksv+RKBSd5m6xZZnXUDq+w05eFVpIDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:47.287925Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.01129","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:925ab6277ce45a36b5ce32ee7d6d0eb63a72a3dbd71cfdef55c6a7fb50e9262b","sha256:e87c965018b70b0fe16157b8e0b40d183b942bbb25f2f5a55b9fddcf98e3177e"],"state_sha256":"66b609579de1cd5b4b765c3d5ede5bf2c698ad85844112c309642ef1b4a014c5"}