{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZEIJ6XRV3IYSHT5UUWSEFM5I5C","short_pith_number":"pith:ZEIJ6XRV","canonical_record":{"source":{"id":"1902.00986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-03T22:58:26Z","cross_cats_sorted":[],"title_canon_sha256":"408185c5a7eeb98b525eb3a570ef966d264b362845cac8f2c13a2b4432b4c69e","abstract_canon_sha256":"51f98a41fcc5c59764fc1156662271ffe3118d53b8a3dbd96f06ab746684380c"},"schema_version":"1.0"},"canonical_sha256":"c9109f5e35da3123cfb4a5a442b3a8e89c6911d6ff6e743e41c96aa11fad51cd","source":{"kind":"arxiv","id":"1902.00986","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00986","created_at":"2026-05-17T23:54:51Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00986v1","created_at":"2026-05-17T23:54:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00986","created_at":"2026-05-17T23:54:51Z"},{"alias_kind":"pith_short_12","alias_value":"ZEIJ6XRV3IYS","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZEIJ6XRV3IYSHT5U","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZEIJ6XRV","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZEIJ6XRV3IYSHT5UUWSEFM5I5C","target":"record","payload":{"canonical_record":{"source":{"id":"1902.00986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-03T22:58:26Z","cross_cats_sorted":[],"title_canon_sha256":"408185c5a7eeb98b525eb3a570ef966d264b362845cac8f2c13a2b4432b4c69e","abstract_canon_sha256":"51f98a41fcc5c59764fc1156662271ffe3118d53b8a3dbd96f06ab746684380c"},"schema_version":"1.0"},"canonical_sha256":"c9109f5e35da3123cfb4a5a442b3a8e89c6911d6ff6e743e41c96aa11fad51cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:51.687691Z","signature_b64":"YOiTzjD33v4gP9ck8qc9Ozw6UPH/LKrSgOK/5iknymmHMPJK6sRFx19kgwQo5uTbk5f6tNXOuCk1HqiyN/0zBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9109f5e35da3123cfb4a5a442b3a8e89c6911d6ff6e743e41c96aa11fad51cd","last_reissued_at":"2026-05-17T23:54:51.687165Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:51.687165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.00986","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-17T23:54:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UJQEGxD9+NP0C4s/MY/Wwe/RIA2px1kIu5dFv9rmG0/zZ4vVbTTnEpuiAqevPVfeOvzkPZyAwpQvgMZlqZ/pCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:37:28.807126Z"},"content_sha256":"436d38b7d3db48a7bbfad8cf5506b507adde86188748c8ed4eba1e5be2255e24","schema_version":"1.0","event_id":"sha256:436d38b7d3db48a7bbfad8cf5506b507adde86188748c8ed4eba1e5be2255e24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZEIJ6XRV3IYSHT5UUWSEFM5I5C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposing split graphs into locally irregular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carla Negri Lintzmayer, Guilherme Oliveira Mota, Maycon Sambinelli","submitted_at":"2019-02-03T22:58:26Z","abstract_excerpt":"A graph is locally irregular if any pair of adjacent vertices have distinct degrees. A locally irregular decomposition of a graph $G$ is a decomposition $\\mathcal{D}$ of $G$ such that every subgraph $H \\in \\mathcal{D}$ is locally irregular. A graph is said to be decomposable if it admits a locally irregular decomposition. We prove that any decomposable split graph can be decomposed into at most three locally irregular subgraphs and we characterize all split graphs whose decomposition can be into one, two or three locally irregular subgraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00986","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-17T23:54:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u03OzEW9SYws0Ry2ZJMtjw2vWICfgsOaoE8UNgMKQ0upYTj/X4QZGtV5r8Btd2hvQ/zgFE5Cm5+YL5YSVFgxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:37:28.807787Z"},"content_sha256":"9706520340894f5a98fccfb0e76d253d22fe3c31297cb9815b8ef3a09e03f4be","schema_version":"1.0","event_id":"sha256:9706520340894f5a98fccfb0e76d253d22fe3c31297cb9815b8ef3a09e03f4be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZEIJ6XRV3IYSHT5UUWSEFM5I5C/bundle.json","state_url":"https://pith.science/pith/ZEIJ6XRV3IYSHT5UUWSEFM5I5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZEIJ6XRV3IYSHT5UUWSEFM5I5C/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-31T02:37:28Z","links":{"resolver":"https://pith.science/pith/ZEIJ6XRV3IYSHT5UUWSEFM5I5C","bundle":"https://pith.science/pith/ZEIJ6XRV3IYSHT5UUWSEFM5I5C/bundle.json","state":"https://pith.science/pith/ZEIJ6XRV3IYSHT5UUWSEFM5I5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZEIJ6XRV3IYSHT5UUWSEFM5I5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZEIJ6XRV3IYSHT5UUWSEFM5I5C","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":"51f98a41fcc5c59764fc1156662271ffe3118d53b8a3dbd96f06ab746684380c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-03T22:58:26Z","title_canon_sha256":"408185c5a7eeb98b525eb3a570ef966d264b362845cac8f2c13a2b4432b4c69e"},"schema_version":"1.0","source":{"id":"1902.00986","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00986","created_at":"2026-05-17T23:54:51Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00986v1","created_at":"2026-05-17T23:54:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00986","created_at":"2026-05-17T23:54:51Z"},{"alias_kind":"pith_short_12","alias_value":"ZEIJ6XRV3IYS","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZEIJ6XRV3IYSHT5U","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZEIJ6XRV","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:9706520340894f5a98fccfb0e76d253d22fe3c31297cb9815b8ef3a09e03f4be","target":"graph","created_at":"2026-05-17T23:54:51Z","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 is locally irregular if any pair of adjacent vertices have distinct degrees. A locally irregular decomposition of a graph $G$ is a decomposition $\\mathcal{D}$ of $G$ such that every subgraph $H \\in \\mathcal{D}$ is locally irregular. A graph is said to be decomposable if it admits a locally irregular decomposition. We prove that any decomposable split graph can be decomposed into at most three locally irregular subgraphs and we characterize all split graphs whose decomposition can be into one, two or three locally irregular subgraphs.","authors_text":"Carla Negri Lintzmayer, Guilherme Oliveira Mota, Maycon Sambinelli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-03T22:58:26Z","title":"Decomposing split graphs into locally irregular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00986","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:436d38b7d3db48a7bbfad8cf5506b507adde86188748c8ed4eba1e5be2255e24","target":"record","created_at":"2026-05-17T23:54:51Z","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":"51f98a41fcc5c59764fc1156662271ffe3118d53b8a3dbd96f06ab746684380c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-03T22:58:26Z","title_canon_sha256":"408185c5a7eeb98b525eb3a570ef966d264b362845cac8f2c13a2b4432b4c69e"},"schema_version":"1.0","source":{"id":"1902.00986","kind":"arxiv","version":1}},"canonical_sha256":"c9109f5e35da3123cfb4a5a442b3a8e89c6911d6ff6e743e41c96aa11fad51cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9109f5e35da3123cfb4a5a442b3a8e89c6911d6ff6e743e41c96aa11fad51cd","first_computed_at":"2026-05-17T23:54:51.687165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:51.687165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YOiTzjD33v4gP9ck8qc9Ozw6UPH/LKrSgOK/5iknymmHMPJK6sRFx19kgwQo5uTbk5f6tNXOuCk1HqiyN/0zBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:51.687691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00986","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:436d38b7d3db48a7bbfad8cf5506b507adde86188748c8ed4eba1e5be2255e24","sha256:9706520340894f5a98fccfb0e76d253d22fe3c31297cb9815b8ef3a09e03f4be"],"state_sha256":"bb84daf5d60fffd7b6e3193ce686940e5182248f3ac37629996775d2526d3d0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uVIY/Snl5emg849GMz+6zJF3Zn2sZEvE+hphIYbzAVZGnZaPdl/72xURRsGFkCsm4hcOtrr+wK/HSfWv2JhtAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:37:28.811003Z","bundle_sha256":"885634bcb5e715e8e0e7284f7f8fb1758d7aaaefc354b07eba27de8a46efa9db"}}