{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:L2MC5PHEDLF76YGE4AGAPBEKCT","short_pith_number":"pith:L2MC5PHE","canonical_record":{"source":{"id":"1110.1194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-06T09:24:51Z","cross_cats_sorted":[],"title_canon_sha256":"3f9b444dbe51af6762c09c894ee502881861b8803412fb5d7829b0bf32fc1a76","abstract_canon_sha256":"42d9095b4fd25195e8f3638972ec34030db3297e976f9eec8a61c67598101535"},"schema_version":"1.0"},"canonical_sha256":"5e982ebce41acbff60c4e00c07848a14f82c6446e574ccf84621436787b14f6e","source":{"kind":"arxiv","id":"1110.1194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1194","created_at":"2026-05-18T04:11:32Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1194v1","created_at":"2026-05-18T04:11:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1194","created_at":"2026-05-18T04:11:32Z"},{"alias_kind":"pith_short_12","alias_value":"L2MC5PHEDLF7","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"L2MC5PHEDLF76YGE","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"L2MC5PHE","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:L2MC5PHEDLF76YGE4AGAPBEKCT","target":"record","payload":{"canonical_record":{"source":{"id":"1110.1194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-06T09:24:51Z","cross_cats_sorted":[],"title_canon_sha256":"3f9b444dbe51af6762c09c894ee502881861b8803412fb5d7829b0bf32fc1a76","abstract_canon_sha256":"42d9095b4fd25195e8f3638972ec34030db3297e976f9eec8a61c67598101535"},"schema_version":"1.0"},"canonical_sha256":"5e982ebce41acbff60c4e00c07848a14f82c6446e574ccf84621436787b14f6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:32.567131Z","signature_b64":"tP0TFQIq0fDbztaoB14zxjGZ2/5jl2ZzE+37nMCINquVvSgth54SeaCqUHLtWtW1vy0ZfGid7jDi9H2b69IbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e982ebce41acbff60c4e00c07848a14f82c6446e574ccf84621436787b14f6e","last_reissued_at":"2026-05-18T04:11:32.566566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:32.566566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.1194","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-18T04:11:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SVeGnVvHuT39svbvNBUqAuHfsIMyuUQj36L7CSrR4MnOuWMkg0Jxfh0b6c7hJfqTMO6Ho7u2hukEV16v7H3QAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:43:32.835228Z"},"content_sha256":"e8641a74d79e54e7787fc384bd7b96f37c41ee77a448c8b0931f075207392bc5","schema_version":"1.0","event_id":"sha256:e8641a74d79e54e7787fc384bd7b96f37c41ee77a448c8b0931f075207392bc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:L2MC5PHEDLF76YGE4AGAPBEKCT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Encoding of Watermark Numbers as Reducible Permutation Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Maria Chroni, Stavros D. Nikolopoulos","submitted_at":"2011-10-06T09:24:51Z","abstract_excerpt":"In a software watermarking environment, several graph theoretic watermark methods use numbers as watermark values, where some of these methods encode the watermark numbers as graph structures. In this paper we extended the class of error correcting graphs by proposing an efficient and easily implemented codec system for encoding watermark numbers as reducible permutation flow-graphs. More precisely, we first present an efficient algorithm which encodes a watermark number $w$ as self-inverting permutation $\\pi^*$ and, then, an algorithm which encodes the self-inverting permutation $\\pi^*$ as a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1194","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-18T04:11:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VWy22mACtL8Cr9TT8jPF+a7wimYbrVoxL9Jha/qpyaYK/8RhEPKU3FIW/ppSvqej7bXOCf2cXSsHpNP/t1BDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:43:32.835593Z"},"content_sha256":"6ef5ebceb12779abf80e746cee42581102c3958f096dc4386bd9e426b8b56b9d","schema_version":"1.0","event_id":"sha256:6ef5ebceb12779abf80e746cee42581102c3958f096dc4386bd9e426b8b56b9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L2MC5PHEDLF76YGE4AGAPBEKCT/bundle.json","state_url":"https://pith.science/pith/L2MC5PHEDLF76YGE4AGAPBEKCT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L2MC5PHEDLF76YGE4AGAPBEKCT/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-22T22:43:32Z","links":{"resolver":"https://pith.science/pith/L2MC5PHEDLF76YGE4AGAPBEKCT","bundle":"https://pith.science/pith/L2MC5PHEDLF76YGE4AGAPBEKCT/bundle.json","state":"https://pith.science/pith/L2MC5PHEDLF76YGE4AGAPBEKCT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L2MC5PHEDLF76YGE4AGAPBEKCT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:L2MC5PHEDLF76YGE4AGAPBEKCT","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":"42d9095b4fd25195e8f3638972ec34030db3297e976f9eec8a61c67598101535","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-06T09:24:51Z","title_canon_sha256":"3f9b444dbe51af6762c09c894ee502881861b8803412fb5d7829b0bf32fc1a76"},"schema_version":"1.0","source":{"id":"1110.1194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1194","created_at":"2026-05-18T04:11:32Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1194v1","created_at":"2026-05-18T04:11:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1194","created_at":"2026-05-18T04:11:32Z"},{"alias_kind":"pith_short_12","alias_value":"L2MC5PHEDLF7","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"L2MC5PHEDLF76YGE","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"L2MC5PHE","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:6ef5ebceb12779abf80e746cee42581102c3958f096dc4386bd9e426b8b56b9d","target":"graph","created_at":"2026-05-18T04:11:32Z","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":"In a software watermarking environment, several graph theoretic watermark methods use numbers as watermark values, where some of these methods encode the watermark numbers as graph structures. In this paper we extended the class of error correcting graphs by proposing an efficient and easily implemented codec system for encoding watermark numbers as reducible permutation flow-graphs. More precisely, we first present an efficient algorithm which encodes a watermark number $w$ as self-inverting permutation $\\pi^*$ and, then, an algorithm which encodes the self-inverting permutation $\\pi^*$ as a ","authors_text":"Maria Chroni, Stavros D. Nikolopoulos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-06T09:24:51Z","title":"Efficient Encoding of Watermark Numbers as Reducible Permutation Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1194","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:e8641a74d79e54e7787fc384bd7b96f37c41ee77a448c8b0931f075207392bc5","target":"record","created_at":"2026-05-18T04:11:32Z","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":"42d9095b4fd25195e8f3638972ec34030db3297e976f9eec8a61c67598101535","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-06T09:24:51Z","title_canon_sha256":"3f9b444dbe51af6762c09c894ee502881861b8803412fb5d7829b0bf32fc1a76"},"schema_version":"1.0","source":{"id":"1110.1194","kind":"arxiv","version":1}},"canonical_sha256":"5e982ebce41acbff60c4e00c07848a14f82c6446e574ccf84621436787b14f6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e982ebce41acbff60c4e00c07848a14f82c6446e574ccf84621436787b14f6e","first_computed_at":"2026-05-18T04:11:32.566566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:32.566566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tP0TFQIq0fDbztaoB14zxjGZ2/5jl2ZzE+37nMCINquVvSgth54SeaCqUHLtWtW1vy0ZfGid7jDi9H2b69IbBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:32.567131Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.1194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8641a74d79e54e7787fc384bd7b96f37c41ee77a448c8b0931f075207392bc5","sha256:6ef5ebceb12779abf80e746cee42581102c3958f096dc4386bd9e426b8b56b9d"],"state_sha256":"ba6ac35b44e6c383b68ae8d7b7dab786254c9a93f510d9b269f1d932bb2490a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KbRApsfjwjREHXVHtnydlIUtNKuwHx1+BgFOBljBcLI7eROOXaBm8RUICPwm5vDlc+kFbQaNeagZFDzhMmPzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:43:32.837504Z","bundle_sha256":"37ca4d485b01286f835bc9ec341cb158497c5e67a0e14de9fd6a96f49c646a19"}}