{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NWMRIKEGSBAG5BJNZE63JIRV5A","short_pith_number":"pith:NWMRIKEG","canonical_record":{"source":{"id":"1802.09333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T04:06:33Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"abb039f9012d2632a9439b216eadc677b4690fbfb2bd9c90bb4eb881df47ac92","abstract_canon_sha256":"ddd2bf5386e4cb92206deeb480feeae7a820124814c03a2d1726911ff7d2bee6"},"schema_version":"1.0"},"canonical_sha256":"6d9914288690406e852dc93db4a235e81abc68aa04003c396e2f24bd3d5f0bbc","source":{"kind":"arxiv","id":"1802.09333","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09333","created_at":"2026-05-18T00:22:34Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09333v1","created_at":"2026-05-18T00:22:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09333","created_at":"2026-05-18T00:22:34Z"},{"alias_kind":"pith_short_12","alias_value":"NWMRIKEGSBAG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NWMRIKEGSBAG5BJN","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NWMRIKEG","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NWMRIKEGSBAG5BJNZE63JIRV5A","target":"record","payload":{"canonical_record":{"source":{"id":"1802.09333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T04:06:33Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"abb039f9012d2632a9439b216eadc677b4690fbfb2bd9c90bb4eb881df47ac92","abstract_canon_sha256":"ddd2bf5386e4cb92206deeb480feeae7a820124814c03a2d1726911ff7d2bee6"},"schema_version":"1.0"},"canonical_sha256":"6d9914288690406e852dc93db4a235e81abc68aa04003c396e2f24bd3d5f0bbc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:34.042140Z","signature_b64":"yaNhOFfRO3tWk+ulQRO2/0fCZMizjwFJdFOLt1OAUMc/D0cGm6BeNw8uG33tc4dNcXD/IFa1FR4llccPOnk9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d9914288690406e852dc93db4a235e81abc68aa04003c396e2f24bd3d5f0bbc","last_reissued_at":"2026-05-18T00:22:34.041627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:34.041627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.09333","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:22:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N6620rCmde/OR5B32TcfJrzC6ooQVV8FD5majNF4qeCWHM9Tra6QKmMDJ6zfeQVRZNpwoHpuF63+90ZUYc0ECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:15:54.112598Z"},"content_sha256":"55c5e762d047a1310aef4eeefcf0b0a2de4baf0949f086a42226334e08eca4a0","schema_version":"1.0","event_id":"sha256:55c5e762d047a1310aef4eeefcf0b0a2de4baf0949f086a42226334e08eca4a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NWMRIKEGSBAG5BJNZE63JIRV5A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Cut and Dominating Set Problem in A Steganographer Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM"],"primary_cat":"cs.DS","authors_text":"Hanzhou Wu, Hongxia Wang, Jing Dong, Lizhi Xiong, Wei Wang","submitted_at":"2018-02-20T04:06:33Z","abstract_excerpt":"A steganographer network corresponds to a graphic structure that the involved vertices (or called nodes) denote social entities such as the data encoders and data decoders, and the associated edges represent any real communicable channels or other social links that could be utilized for steganography. Unlike traditional steganographic algorithms, a steganographer network models steganographic communication by an abstract way such that the concerned underlying characteristics of steganography are quantized as analyzable parameters in the network. In this paper, we will analyze two problems in a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09333","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:22:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"My+PmmNwExxc9LNb+GyQwln6QIS23KyHR9ecb9biNXi56GG8B0gM86RvVuFOH43n68+fUqDBnEhAF5fTRxD8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:15:54.113201Z"},"content_sha256":"22cf4289938c2e4ba51aed94b780750f873d78d2c00421ad96f6c588053696f6","schema_version":"1.0","event_id":"sha256:22cf4289938c2e4ba51aed94b780750f873d78d2c00421ad96f6c588053696f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWMRIKEGSBAG5BJNZE63JIRV5A/bundle.json","state_url":"https://pith.science/pith/NWMRIKEGSBAG5BJNZE63JIRV5A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWMRIKEGSBAG5BJNZE63JIRV5A/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-27T08:15:54Z","links":{"resolver":"https://pith.science/pith/NWMRIKEGSBAG5BJNZE63JIRV5A","bundle":"https://pith.science/pith/NWMRIKEGSBAG5BJNZE63JIRV5A/bundle.json","state":"https://pith.science/pith/NWMRIKEGSBAG5BJNZE63JIRV5A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWMRIKEGSBAG5BJNZE63JIRV5A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NWMRIKEGSBAG5BJNZE63JIRV5A","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":"ddd2bf5386e4cb92206deeb480feeae7a820124814c03a2d1726911ff7d2bee6","cross_cats_sorted":["cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T04:06:33Z","title_canon_sha256":"abb039f9012d2632a9439b216eadc677b4690fbfb2bd9c90bb4eb881df47ac92"},"schema_version":"1.0","source":{"id":"1802.09333","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09333","created_at":"2026-05-18T00:22:34Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09333v1","created_at":"2026-05-18T00:22:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09333","created_at":"2026-05-18T00:22:34Z"},{"alias_kind":"pith_short_12","alias_value":"NWMRIKEGSBAG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NWMRIKEGSBAG5BJN","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NWMRIKEG","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:22cf4289938c2e4ba51aed94b780750f873d78d2c00421ad96f6c588053696f6","target":"graph","created_at":"2026-05-18T00:22:34Z","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 steganographer network corresponds to a graphic structure that the involved vertices (or called nodes) denote social entities such as the data encoders and data decoders, and the associated edges represent any real communicable channels or other social links that could be utilized for steganography. Unlike traditional steganographic algorithms, a steganographer network models steganographic communication by an abstract way such that the concerned underlying characteristics of steganography are quantized as analyzable parameters in the network. In this paper, we will analyze two problems in a","authors_text":"Hanzhou Wu, Hongxia Wang, Jing Dong, Lizhi Xiong, Wei Wang","cross_cats":["cs.MM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T04:06:33Z","title":"The Cut and Dominating Set Problem in A Steganographer Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09333","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:55c5e762d047a1310aef4eeefcf0b0a2de4baf0949f086a42226334e08eca4a0","target":"record","created_at":"2026-05-18T00:22:34Z","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":"ddd2bf5386e4cb92206deeb480feeae7a820124814c03a2d1726911ff7d2bee6","cross_cats_sorted":["cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T04:06:33Z","title_canon_sha256":"abb039f9012d2632a9439b216eadc677b4690fbfb2bd9c90bb4eb881df47ac92"},"schema_version":"1.0","source":{"id":"1802.09333","kind":"arxiv","version":1}},"canonical_sha256":"6d9914288690406e852dc93db4a235e81abc68aa04003c396e2f24bd3d5f0bbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d9914288690406e852dc93db4a235e81abc68aa04003c396e2f24bd3d5f0bbc","first_computed_at":"2026-05-18T00:22:34.041627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:34.041627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yaNhOFfRO3tWk+ulQRO2/0fCZMizjwFJdFOLt1OAUMc/D0cGm6BeNw8uG33tc4dNcXD/IFa1FR4llccPOnk9Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:34.042140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09333","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55c5e762d047a1310aef4eeefcf0b0a2de4baf0949f086a42226334e08eca4a0","sha256:22cf4289938c2e4ba51aed94b780750f873d78d2c00421ad96f6c588053696f6"],"state_sha256":"378bdfb6d5f833aa7d23c1fb520d9fee7c7674cb96d3d8953961cea11d279b48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zingIIbwb/JT9D3/YK8HFjT8W/9ofT6SypLDqqy3WntWZS9jr/16xXPZzNUSStoQJchOZXMxZfDi4+/uG/ZYDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:15:54.116076Z","bundle_sha256":"09059d22bf3ab92752cb037bee5aca00678fa7d5ba4091c08d5ce04d4bfd055e"}}