{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KG2NQHVOPKPSQ7MIEEYLUTBALY","short_pith_number":"pith:KG2NQHVO","schema_version":"1.0","canonical_sha256":"51b4d81eae7a9f287d882130ba4c205e1d1b4c3b5b0f0863053f38e82794302e","source":{"kind":"arxiv","id":"1812.11080","version":1},"attestation_state":"computed","paper":{"title":"Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DM","authors_text":"Anna Mpanti, Leonidas Palios, Stavros D. Nikolopoulos","submitted_at":"2018-12-28T16:07:59Z","abstract_excerpt":"In the domain of software watermarking, we have proposed several graph theoretic watermarking codec systems for encoding watermark numbers $w$ as reducible permutation flow-graphs $F[\\pi^*]$ through the use of self-inverting permutations $\\pi^*$. Following up on our proposed methods, we theoretically study the oldest one, which we call W-RPG, in order to investigate and prove its resilience to edge-modification attacks on the flow-graphs $F[\\pi^*]$. In particular, we characterize the integer $w\\equiv\\pi^*$ as strong or weak watermark through the structure of self-inverting permutations $\\pi^*$"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1812.11080","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-28T16:07:59Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"202d821eefb9e23f549963cfc9c512c34151e9569a2046ef5307ece1c44fec81","abstract_canon_sha256":"a3f17354d4ff0ea04eaa1e90846b0a4828a5fb88a2d6219b673e53b8ca8a801e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:16.374606Z","signature_b64":"qa/SqeT4xC/1/17IeYbpO4Oc0RyGGyDL1d6TN4fPxLTZkS1xjslrtVFFychSKLyuPcF+CWcG6GgrPVmEl6g8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51b4d81eae7a9f287d882130ba4c205e1d1b4c3b5b0f0863053f38e82794302e","last_reissued_at":"2026-05-17T23:57:16.374219Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:16.374219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DM","authors_text":"Anna Mpanti, Leonidas Palios, Stavros D. Nikolopoulos","submitted_at":"2018-12-28T16:07:59Z","abstract_excerpt":"In the domain of software watermarking, we have proposed several graph theoretic watermarking codec systems for encoding watermark numbers $w$ as reducible permutation flow-graphs $F[\\pi^*]$ through the use of self-inverting permutations $\\pi^*$. Following up on our proposed methods, we theoretically study the oldest one, which we call W-RPG, in order to investigate and prove its resilience to edge-modification attacks on the flow-graphs $F[\\pi^*]$. In particular, we characterize the integer $w\\equiv\\pi^*$ as strong or weak watermark through the structure of self-inverting permutations $\\pi^*$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11080","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.11080","created_at":"2026-05-17T23:57:16.374284+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.11080v1","created_at":"2026-05-17T23:57:16.374284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11080","created_at":"2026-05-17T23:57:16.374284+00:00"},{"alias_kind":"pith_short_12","alias_value":"KG2NQHVOPKPS","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KG2NQHVOPKPSQ7MI","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KG2NQHVO","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KG2NQHVOPKPSQ7MIEEYLUTBALY","json":"https://pith.science/pith/KG2NQHVOPKPSQ7MIEEYLUTBALY.json","graph_json":"https://pith.science/api/pith-number/KG2NQHVOPKPSQ7MIEEYLUTBALY/graph.json","events_json":"https://pith.science/api/pith-number/KG2NQHVOPKPSQ7MIEEYLUTBALY/events.json","paper":"https://pith.science/paper/KG2NQHVO"},"agent_actions":{"view_html":"https://pith.science/pith/KG2NQHVOPKPSQ7MIEEYLUTBALY","download_json":"https://pith.science/pith/KG2NQHVOPKPSQ7MIEEYLUTBALY.json","view_paper":"https://pith.science/paper/KG2NQHVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.11080&json=true","fetch_graph":"https://pith.science/api/pith-number/KG2NQHVOPKPSQ7MIEEYLUTBALY/graph.json","fetch_events":"https://pith.science/api/pith-number/KG2NQHVOPKPSQ7MIEEYLUTBALY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KG2NQHVOPKPSQ7MIEEYLUTBALY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KG2NQHVOPKPSQ7MIEEYLUTBALY/action/storage_attestation","attest_author":"https://pith.science/pith/KG2NQHVOPKPSQ7MIEEYLUTBALY/action/author_attestation","sign_citation":"https://pith.science/pith/KG2NQHVOPKPSQ7MIEEYLUTBALY/action/citation_signature","submit_replication":"https://pith.science/pith/KG2NQHVOPKPSQ7MIEEYLUTBALY/action/replication_record"}},"created_at":"2026-05-17T23:57:16.374284+00:00","updated_at":"2026-05-17T23:57:16.374284+00:00"}