{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UD3EUI33N5LXANXPBW6NEA46H4","short_pith_number":"pith:UD3EUI33","canonical_record":{"source":{"id":"1904.09438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-20T12:05:49Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"b311daaac6a10c4b280863d9027d3fb708a99a9e3f9e025aa8a1389297b3455d","abstract_canon_sha256":"08939fdd41e4b35758ee42c281a4c6eb2b46bd34d4919d044649e2d691b3fe04"},"schema_version":"1.0"},"canonical_sha256":"a0f64a237b6f577036ef0dbcd2039e3f1f8b7094bf694d70191a48b294ed3bee","source":{"kind":"arxiv","id":"1904.09438","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09438","created_at":"2026-05-17T23:48:04Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09438v1","created_at":"2026-05-17T23:48:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09438","created_at":"2026-05-17T23:48:04Z"},{"alias_kind":"pith_short_12","alias_value":"UD3EUI33N5LX","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UD3EUI33N5LXANXP","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UD3EUI33","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UD3EUI33N5LXANXPBW6NEA46H4","target":"record","payload":{"canonical_record":{"source":{"id":"1904.09438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-20T12:05:49Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"b311daaac6a10c4b280863d9027d3fb708a99a9e3f9e025aa8a1389297b3455d","abstract_canon_sha256":"08939fdd41e4b35758ee42c281a4c6eb2b46bd34d4919d044649e2d691b3fe04"},"schema_version":"1.0"},"canonical_sha256":"a0f64a237b6f577036ef0dbcd2039e3f1f8b7094bf694d70191a48b294ed3bee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:04.187551Z","signature_b64":"Rt3vPSVx9ryiQMJD52HIosTl0N3C3Kr1wpwbi7RZYyKTB2Ae9KthBy+lUb5vjiCahOkhENwTjZyd5Su2vwyLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0f64a237b6f577036ef0dbcd2039e3f1f8b7094bf694d70191a48b294ed3bee","last_reissued_at":"2026-05-17T23:48:04.187149Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:04.187149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.09438","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:48:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mFXSFvc2ER/UA1Lj5YI2cgv0XgGTnmYBUdhG5KAITn+Drk/HvDM+YoZ1GyS60BAg1GtkNo1OXwS3Qn8qBeh0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:35:47.124581Z"},"content_sha256":"c7d130f692ccda7f67297c7725c5ba19c8b74f97e80dbc225a840932dc17f403","schema_version":"1.0","event_id":"sha256:c7d130f692ccda7f67297c7725c5ba19c8b74f97e80dbc225a840932dc17f403"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UD3EUI33N5LXANXPBW6NEA46H4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposing a Graph into Unigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Jun Kawahara, Shin-ichi Minato, Takashi Horiyama, Yu Nakahata","submitted_at":"2019-04-20T12:05:49Z","abstract_excerpt":"Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. There are many subclasses of unigraphs such as threshold graphs, split matrogenic graphs, matroidal graphs, and matrogenic graphs. Unigraphs and these subclasses are well studied in the literature. Nevertheless, there are few results on superclasses of unigraphs. In this paper, we introduce two types of generalizations of unigraphs: $k$-unigraphs and $k$-strong unigraphs. We say that a graph $G$ is a $k$-unigraph if $G$ can be partitioned into $k$ unigraphs. $G$ is a $k$-strong unigraph if not only each su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09438","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:48:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/q0nw6FchrLo2TyY77CdCgLV0q/L7mXSUNEvLYuH2uY3RA7WIPetR48iypib8xzFGz9pc8tmdD72YoZ3qKAlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:35:47.124943Z"},"content_sha256":"581e3d1b31adafe28657d0f037b2a496d4e9c0662c9c8d5121b4de82e5743d88","schema_version":"1.0","event_id":"sha256:581e3d1b31adafe28657d0f037b2a496d4e9c0662c9c8d5121b4de82e5743d88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UD3EUI33N5LXANXPBW6NEA46H4/bundle.json","state_url":"https://pith.science/pith/UD3EUI33N5LXANXPBW6NEA46H4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UD3EUI33N5LXANXPBW6NEA46H4/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-30T23:35:47Z","links":{"resolver":"https://pith.science/pith/UD3EUI33N5LXANXPBW6NEA46H4","bundle":"https://pith.science/pith/UD3EUI33N5LXANXPBW6NEA46H4/bundle.json","state":"https://pith.science/pith/UD3EUI33N5LXANXPBW6NEA46H4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UD3EUI33N5LXANXPBW6NEA46H4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UD3EUI33N5LXANXPBW6NEA46H4","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":"08939fdd41e4b35758ee42c281a4c6eb2b46bd34d4919d044649e2d691b3fe04","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-20T12:05:49Z","title_canon_sha256":"b311daaac6a10c4b280863d9027d3fb708a99a9e3f9e025aa8a1389297b3455d"},"schema_version":"1.0","source":{"id":"1904.09438","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09438","created_at":"2026-05-17T23:48:04Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09438v1","created_at":"2026-05-17T23:48:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09438","created_at":"2026-05-17T23:48:04Z"},{"alias_kind":"pith_short_12","alias_value":"UD3EUI33N5LX","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UD3EUI33N5LXANXP","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UD3EUI33","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:581e3d1b31adafe28657d0f037b2a496d4e9c0662c9c8d5121b4de82e5743d88","target":"graph","created_at":"2026-05-17T23:48:04Z","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":"Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. There are many subclasses of unigraphs such as threshold graphs, split matrogenic graphs, matroidal graphs, and matrogenic graphs. Unigraphs and these subclasses are well studied in the literature. Nevertheless, there are few results on superclasses of unigraphs. In this paper, we introduce two types of generalizations of unigraphs: $k$-unigraphs and $k$-strong unigraphs. We say that a graph $G$ is a $k$-unigraph if $G$ can be partitioned into $k$ unigraphs. $G$ is a $k$-strong unigraph if not only each su","authors_text":"Jun Kawahara, Shin-ichi Minato, Takashi Horiyama, Yu Nakahata","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-20T12:05:49Z","title":"Decomposing a Graph into Unigraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09438","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:c7d130f692ccda7f67297c7725c5ba19c8b74f97e80dbc225a840932dc17f403","target":"record","created_at":"2026-05-17T23:48:04Z","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":"08939fdd41e4b35758ee42c281a4c6eb2b46bd34d4919d044649e2d691b3fe04","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-20T12:05:49Z","title_canon_sha256":"b311daaac6a10c4b280863d9027d3fb708a99a9e3f9e025aa8a1389297b3455d"},"schema_version":"1.0","source":{"id":"1904.09438","kind":"arxiv","version":1}},"canonical_sha256":"a0f64a237b6f577036ef0dbcd2039e3f1f8b7094bf694d70191a48b294ed3bee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0f64a237b6f577036ef0dbcd2039e3f1f8b7094bf694d70191a48b294ed3bee","first_computed_at":"2026-05-17T23:48:04.187149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:04.187149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rt3vPSVx9ryiQMJD52HIosTl0N3C3Kr1wpwbi7RZYyKTB2Ae9KthBy+lUb5vjiCahOkhENwTjZyd5Su2vwyLBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:04.187551Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.09438","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7d130f692ccda7f67297c7725c5ba19c8b74f97e80dbc225a840932dc17f403","sha256:581e3d1b31adafe28657d0f037b2a496d4e9c0662c9c8d5121b4de82e5743d88"],"state_sha256":"ba656b3a766857aba3ffbf46b4527c23d04f8b5376bba371941d700cd288011e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MQyBur0CQlAVc5F03u84W7tVNU/I+N/nC0M2rbwAOW0CFHnyK3ICNGWOYgf8VxJh+E4fy2/hlQlZ+LrCegx7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:35:47.127003Z","bundle_sha256":"23a65020b42b174e68848cce9c5631c9f058ceb1ede35b6e759544f521a300a4"}}