{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7WEHUIJTCOBV767WZR72ZHVXZU","short_pith_number":"pith:7WEHUIJT","schema_version":"1.0","canonical_sha256":"fd887a213313835ffbf6cc7fac9eb7cd0fc66effb1cd70220f975208c5e3fedd","source":{"kind":"arxiv","id":"1302.7262","version":6},"attestation_state":"computed","paper":{"title":"Towards a provably resilient scheme for graph-based watermarking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS"],"primary_cat":"cs.MM","authors_text":"Davidson Boccardo, Jayme L. Szwarcfiter, Lucila M. S. Bento, Raphael C. S. Machado, Vin\\'icius G. Pereira de S\\'a","submitted_at":"2013-02-28T17:15:44Z","abstract_excerpt":"Digital watermarks have been considered a promising way to fight software piracy. Graph-based watermarking schemes encode authorship/ownership data as control-flow graph of dummy code. In 2012, Chroni and Nikolopoulos developed an ingenious such scheme which was claimed to withstand attacks in the form of a single edge removal. We extend the work of those authors in various aspects. First, we give a formal characterization of the class of graphs generated by their encoding function. Then, we formulate a linear-time algorithm which recovers from ill-intentioned removals of $k \\leq 2$ edges, the"},"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":"1302.7262","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2013-02-28T17:15:44Z","cross_cats_sorted":["cs.CR","cs.DS"],"title_canon_sha256":"04dfbed214dae2c683f44d813ba0ee32b7523201e87578d2def8c55c2a40bf16","abstract_canon_sha256":"f96ff4925c6a8c2194f2f79d014d47e867441b1ffecb18c828b2a5994b693b52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:21.099869Z","signature_b64":"19GYFbulj5v5y6CyNoxu5lWlSWcKsgvkY+OXM6FeKeAk80m2j34hNV/JWx/1nxVFtDfna6aFWX/fG3HgWszxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd887a213313835ffbf6cc7fac9eb7cd0fc66effb1cd70220f975208c5e3fedd","last_reissued_at":"2026-05-18T03:03:21.099311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:21.099311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a provably resilient scheme for graph-based watermarking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS"],"primary_cat":"cs.MM","authors_text":"Davidson Boccardo, Jayme L. Szwarcfiter, Lucila M. S. Bento, Raphael C. S. Machado, Vin\\'icius G. Pereira de S\\'a","submitted_at":"2013-02-28T17:15:44Z","abstract_excerpt":"Digital watermarks have been considered a promising way to fight software piracy. Graph-based watermarking schemes encode authorship/ownership data as control-flow graph of dummy code. In 2012, Chroni and Nikolopoulos developed an ingenious such scheme which was claimed to withstand attacks in the form of a single edge removal. We extend the work of those authors in various aspects. First, we give a formal characterization of the class of graphs generated by their encoding function. Then, we formulate a linear-time algorithm which recovers from ill-intentioned removals of $k \\leq 2$ edges, the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.7262","kind":"arxiv","version":6},"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":"1302.7262","created_at":"2026-05-18T03:03:21.099408+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.7262v6","created_at":"2026-05-18T03:03:21.099408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.7262","created_at":"2026-05-18T03:03:21.099408+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WEHUIJTCOBV","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WEHUIJTCOBV767W","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WEHUIJT","created_at":"2026-05-18T12:27:38.830355+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/7WEHUIJTCOBV767WZR72ZHVXZU","json":"https://pith.science/pith/7WEHUIJTCOBV767WZR72ZHVXZU.json","graph_json":"https://pith.science/api/pith-number/7WEHUIJTCOBV767WZR72ZHVXZU/graph.json","events_json":"https://pith.science/api/pith-number/7WEHUIJTCOBV767WZR72ZHVXZU/events.json","paper":"https://pith.science/paper/7WEHUIJT"},"agent_actions":{"view_html":"https://pith.science/pith/7WEHUIJTCOBV767WZR72ZHVXZU","download_json":"https://pith.science/pith/7WEHUIJTCOBV767WZR72ZHVXZU.json","view_paper":"https://pith.science/paper/7WEHUIJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.7262&json=true","fetch_graph":"https://pith.science/api/pith-number/7WEHUIJTCOBV767WZR72ZHVXZU/graph.json","fetch_events":"https://pith.science/api/pith-number/7WEHUIJTCOBV767WZR72ZHVXZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WEHUIJTCOBV767WZR72ZHVXZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WEHUIJTCOBV767WZR72ZHVXZU/action/storage_attestation","attest_author":"https://pith.science/pith/7WEHUIJTCOBV767WZR72ZHVXZU/action/author_attestation","sign_citation":"https://pith.science/pith/7WEHUIJTCOBV767WZR72ZHVXZU/action/citation_signature","submit_replication":"https://pith.science/pith/7WEHUIJTCOBV767WZR72ZHVXZU/action/replication_record"}},"created_at":"2026-05-18T03:03:21.099408+00:00","updated_at":"2026-05-18T03:03:21.099408+00:00"}