{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6EQL7YAG3T5PCNVY4JZUFP3RVD","short_pith_number":"pith:6EQL7YAG","schema_version":"1.0","canonical_sha256":"f120bfe006dcfaf136b8e27342bf71a8cc0b70822588fc6ad97f84c0401eab4f","source":{"kind":"arxiv","id":"1403.6658","version":1},"attestation_state":"computed","paper":{"title":"WaterRPG: A Graph-based Dynamic Watermarking Model for Software Protection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.MM","authors_text":"Ioannis Chionis, Maria Chroni, Stavros D. Nikolopoulos","submitted_at":"2014-03-17T11:31:49Z","abstract_excerpt":"Software watermarking involves embedding a unique identifier or, equivalently, a watermark value within a software to prove owner's authenticity and thus to prevent or discourage copyright infringement. Towards the embedding process, several graph theoretic watermarking algorithmic techniques encode the watermark values as graph structures and embed them in application programs. Recently, we presented an efficient codec system for encoding a watermark number $w$ as a reducible permutation graph $F[\\pi^*]$ through the use of self-inverting permutations $\\pi^*$. In this paper, we propose a dynam"},"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":"1403.6658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2014-03-17T11:31:49Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"0059a97545f51ce524e6df98461388088a3830b60d112d931e766b1b879abcb4","abstract_canon_sha256":"94c7879f327ecf6d2f088f034008fd85dbf4070e8f2ded40b4e211033e70b4f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:28.362946Z","signature_b64":"WuvGSxKaacrY36QMcZjPqqEucME6QzLQr8RPXcf0BL24WKCr62ZIvDetnoRAtGrjlcayhzhGIxPqndy3aifMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f120bfe006dcfaf136b8e27342bf71a8cc0b70822588fc6ad97f84c0401eab4f","last_reissued_at":"2026-05-18T02:55:28.362409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:28.362409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"WaterRPG: A Graph-based Dynamic Watermarking Model for Software Protection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.MM","authors_text":"Ioannis Chionis, Maria Chroni, Stavros D. Nikolopoulos","submitted_at":"2014-03-17T11:31:49Z","abstract_excerpt":"Software watermarking involves embedding a unique identifier or, equivalently, a watermark value within a software to prove owner's authenticity and thus to prevent or discourage copyright infringement. Towards the embedding process, several graph theoretic watermarking algorithmic techniques encode the watermark values as graph structures and embed them in application programs. Recently, we presented an efficient codec system for encoding a watermark number $w$ as a reducible permutation graph $F[\\pi^*]$ through the use of self-inverting permutations $\\pi^*$. In this paper, we propose a dynam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6658","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":"1403.6658","created_at":"2026-05-18T02:55:28.362493+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6658v1","created_at":"2026-05-18T02:55:28.362493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6658","created_at":"2026-05-18T02:55:28.362493+00:00"},{"alias_kind":"pith_short_12","alias_value":"6EQL7YAG3T5P","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6EQL7YAG3T5PCNVY","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6EQL7YAG","created_at":"2026-05-18T12:28:16.859392+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/6EQL7YAG3T5PCNVY4JZUFP3RVD","json":"https://pith.science/pith/6EQL7YAG3T5PCNVY4JZUFP3RVD.json","graph_json":"https://pith.science/api/pith-number/6EQL7YAG3T5PCNVY4JZUFP3RVD/graph.json","events_json":"https://pith.science/api/pith-number/6EQL7YAG3T5PCNVY4JZUFP3RVD/events.json","paper":"https://pith.science/paper/6EQL7YAG"},"agent_actions":{"view_html":"https://pith.science/pith/6EQL7YAG3T5PCNVY4JZUFP3RVD","download_json":"https://pith.science/pith/6EQL7YAG3T5PCNVY4JZUFP3RVD.json","view_paper":"https://pith.science/paper/6EQL7YAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6658&json=true","fetch_graph":"https://pith.science/api/pith-number/6EQL7YAG3T5PCNVY4JZUFP3RVD/graph.json","fetch_events":"https://pith.science/api/pith-number/6EQL7YAG3T5PCNVY4JZUFP3RVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6EQL7YAG3T5PCNVY4JZUFP3RVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6EQL7YAG3T5PCNVY4JZUFP3RVD/action/storage_attestation","attest_author":"https://pith.science/pith/6EQL7YAG3T5PCNVY4JZUFP3RVD/action/author_attestation","sign_citation":"https://pith.science/pith/6EQL7YAG3T5PCNVY4JZUFP3RVD/action/citation_signature","submit_replication":"https://pith.science/pith/6EQL7YAG3T5PCNVY4JZUFP3RVD/action/replication_record"}},"created_at":"2026-05-18T02:55:28.362493+00:00","updated_at":"2026-05-18T02:55:28.362493+00:00"}