{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2YUVIEHHVX5KE6TJUYPUK563H4","short_pith_number":"pith:2YUVIEHH","canonical_record":{"source":{"id":"1801.04472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-13T18:12:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0a47a8d92244e4366a354e117b5e85d9f3345ec3d44f3435a75dc90fa3e3bc8e","abstract_canon_sha256":"0b2da088f34f28201ec289a2c3cd8b44ec2c73c5618c0fe3660cb1d1149a7ce5"},"schema_version":"1.0"},"canonical_sha256":"d6295410e7adfaa27a69a61f4577db3f2c3d88d4f13ed8731394949d4afa3773","source":{"kind":"arxiv","id":"1801.04472","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04472","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04472v1","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04472","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"pith_short_12","alias_value":"2YUVIEHHVX5K","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2YUVIEHHVX5KE6TJ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2YUVIEHH","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2YUVIEHHVX5KE6TJUYPUK563H4","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-13T18:12:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0a47a8d92244e4366a354e117b5e85d9f3345ec3d44f3435a75dc90fa3e3bc8e","abstract_canon_sha256":"0b2da088f34f28201ec289a2c3cd8b44ec2c73c5618c0fe3660cb1d1149a7ce5"},"schema_version":"1.0"},"canonical_sha256":"d6295410e7adfaa27a69a61f4577db3f2c3d88d4f13ed8731394949d4afa3773","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:06.386623Z","signature_b64":"zkJomnxTfDWafeIvSebebevEMIZnYAZ2c3Bsxm7TIiAmgf4Oas5u3R2yeJ8yMHLYpx75uSY4O1zQyqhTg0sdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6295410e7adfaa27a69a61f4577db3f2c3d88d4f13ed8731394949d4afa3773","last_reissued_at":"2026-05-18T00:26:06.385937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:06.385937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04472","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-18T00:26:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2BZnGy+4/JKrzh0fi0xWQeUwgvrpCzMIXW91fdiUy6SPEm+Udw5SXeCAwe2YrGCiUqperndm1Zotj4Tr8pH+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T03:13:01.279042Z"},"content_sha256":"f20a8a362398b9d2dcd7e0cebef9d49e7c7384de0d74197d19163034a63b9e6f","schema_version":"1.0","event_id":"sha256:f20a8a362398b9d2dcd7e0cebef9d49e7c7384de0d74197d19163034a63b9e6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2YUVIEHHVX5KE6TJUYPUK563H4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ali Dehghan, Arash Ahadi, Mohammad-Reza Sadeghi","submitted_at":"2018-01-13T18:12:57Z","abstract_excerpt":"A Not-All-Equal (NAE) decomposition of a graph $G$ is a decomposition of the vertices of $G$ into two parts such that each vertex in $G$ has at least one neighbor in each part. Also, a 1-in-Degree decomposition of a graph $G$ is a decomposition of the vertices of $G$ into two parts $A$ and $B$ such that each vertex in the graph $G$ has exactly one neighbor in part $A$. Among our results, we show that for a given graph $G$, if $G$ does not have any cycle of length congruent to 2 mod 4, then there is a polynomial time algorithm to decide whether $G$ has a 1-in-Degree decomposition. In sharp cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04472","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-18T00:26:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gbfxEIELY43w7jSpoFrSoGG9EIYNTz2UVBYAuw/4pQg7gbq7a4CxaTbQvXur//DGREBmVn1+ZjS3940sUjt1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T03:13:01.279403Z"},"content_sha256":"1bc3c542910f60be7dec0485dbe1347f157d96f9c51dc015c4b5218f3a5400b9","schema_version":"1.0","event_id":"sha256:1bc3c542910f60be7dec0485dbe1347f157d96f9c51dc015c4b5218f3a5400b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YUVIEHHVX5KE6TJUYPUK563H4/bundle.json","state_url":"https://pith.science/pith/2YUVIEHHVX5KE6TJUYPUK563H4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YUVIEHHVX5KE6TJUYPUK563H4/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-22T03:13:01Z","links":{"resolver":"https://pith.science/pith/2YUVIEHHVX5KE6TJUYPUK563H4","bundle":"https://pith.science/pith/2YUVIEHHVX5KE6TJUYPUK563H4/bundle.json","state":"https://pith.science/pith/2YUVIEHHVX5KE6TJUYPUK563H4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YUVIEHHVX5KE6TJUYPUK563H4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2YUVIEHHVX5KE6TJUYPUK563H4","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":"0b2da088f34f28201ec289a2c3cd8b44ec2c73c5618c0fe3660cb1d1149a7ce5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-13T18:12:57Z","title_canon_sha256":"0a47a8d92244e4366a354e117b5e85d9f3345ec3d44f3435a75dc90fa3e3bc8e"},"schema_version":"1.0","source":{"id":"1801.04472","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04472","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04472v1","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04472","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"pith_short_12","alias_value":"2YUVIEHHVX5K","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2YUVIEHHVX5KE6TJ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2YUVIEHH","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:1bc3c542910f60be7dec0485dbe1347f157d96f9c51dc015c4b5218f3a5400b9","target":"graph","created_at":"2026-05-18T00:26:06Z","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 Not-All-Equal (NAE) decomposition of a graph $G$ is a decomposition of the vertices of $G$ into two parts such that each vertex in $G$ has at least one neighbor in each part. Also, a 1-in-Degree decomposition of a graph $G$ is a decomposition of the vertices of $G$ into two parts $A$ and $B$ such that each vertex in the graph $G$ has exactly one neighbor in part $A$. Among our results, we show that for a given graph $G$, if $G$ does not have any cycle of length congruent to 2 mod 4, then there is a polynomial time algorithm to decide whether $G$ has a 1-in-Degree decomposition. In sharp cont","authors_text":"Ali Dehghan, Arash Ahadi, Mohammad-Reza Sadeghi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-13T18:12:57Z","title":"Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04472","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:f20a8a362398b9d2dcd7e0cebef9d49e7c7384de0d74197d19163034a63b9e6f","target":"record","created_at":"2026-05-18T00:26:06Z","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":"0b2da088f34f28201ec289a2c3cd8b44ec2c73c5618c0fe3660cb1d1149a7ce5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-13T18:12:57Z","title_canon_sha256":"0a47a8d92244e4366a354e117b5e85d9f3345ec3d44f3435a75dc90fa3e3bc8e"},"schema_version":"1.0","source":{"id":"1801.04472","kind":"arxiv","version":1}},"canonical_sha256":"d6295410e7adfaa27a69a61f4577db3f2c3d88d4f13ed8731394949d4afa3773","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6295410e7adfaa27a69a61f4577db3f2c3d88d4f13ed8731394949d4afa3773","first_computed_at":"2026-05-18T00:26:06.385937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:06.385937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zkJomnxTfDWafeIvSebebevEMIZnYAZ2c3Bsxm7TIiAmgf4Oas5u3R2yeJ8yMHLYpx75uSY4O1zQyqhTg0sdAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:06.386623Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04472","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f20a8a362398b9d2dcd7e0cebef9d49e7c7384de0d74197d19163034a63b9e6f","sha256:1bc3c542910f60be7dec0485dbe1347f157d96f9c51dc015c4b5218f3a5400b9"],"state_sha256":"7c95bd1161b917324fa4d5926fc09d186eaf8c00faaf76313e1e2fcbb02c4aec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGR9dKIlmL6ZvdH5biP9yf2JSqjigfZ5WGoZh3GnJ56kbxc20a9IHgdHAsqP6wMGMCvLC16Go6CDaZF0OElfBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T03:13:01.281371Z","bundle_sha256":"6e393514ed95fdf0e0822249b761dc0c1f10d7fd7d118291cdf73448e09cf81e"}}