{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7WEHUIJTCOBV767WZR72ZHVXZU","short_pith_number":"pith:7WEHUIJT","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"},"canonical_sha256":"fd887a213313835ffbf6cc7fac9eb7cd0fc66effb1cd70220f975208c5e3fedd","source":{"kind":"arxiv","id":"1302.7262","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.7262","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1302.7262v6","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.7262","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"7WEHUIJTCOBV","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7WEHUIJTCOBV767W","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7WEHUIJT","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7WEHUIJTCOBV767WZR72ZHVXZU","target":"record","payload":{"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"},"canonical_sha256":"fd887a213313835ffbf6cc7fac9eb7cd0fc66effb1cd70220f975208c5e3fedd","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"},"source_kind":"arxiv","source_id":"1302.7262","source_version":6,"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-18T03:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bBGZkHzbJRVEpe5Kjf43TVo/miv1rMzBbqf1NgQgWv9ju/hZS3HVOJ5b27AwZnPYhkYq7VfmzvIApBFG6DsUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:22:12.593532Z"},"content_sha256":"b06a972aac7d74f0edde3b077b20829ad50ca6592153864f1e45b9931f4733a8","schema_version":"1.0","event_id":"sha256:b06a972aac7d74f0edde3b077b20829ad50ca6592153864f1e45b9931f4733a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7WEHUIJTCOBV767WZR72ZHVXZU","target":"graph","payload":{"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"},"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-18T03:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vCQKa/pauKh9zRRXIAl1VWipTPp2yTBKyKPz2Kj4i5qDa1ufCYA0ihVqnHjrMj22UjJMus4dbVUPwDc3VV55Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:22:12.593881Z"},"content_sha256":"e9d64312ab41cfe9b00ac72221ab59e7c560c7a3537b3362142f94bccb7fd88e","schema_version":"1.0","event_id":"sha256:e9d64312ab41cfe9b00ac72221ab59e7c560c7a3537b3362142f94bccb7fd88e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WEHUIJTCOBV767WZR72ZHVXZU/bundle.json","state_url":"https://pith.science/pith/7WEHUIJTCOBV767WZR72ZHVXZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WEHUIJTCOBV767WZR72ZHVXZU/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-11T13:22:12Z","links":{"resolver":"https://pith.science/pith/7WEHUIJTCOBV767WZR72ZHVXZU","bundle":"https://pith.science/pith/7WEHUIJTCOBV767WZR72ZHVXZU/bundle.json","state":"https://pith.science/pith/7WEHUIJTCOBV767WZR72ZHVXZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WEHUIJTCOBV767WZR72ZHVXZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7WEHUIJTCOBV767WZR72ZHVXZU","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":"f96ff4925c6a8c2194f2f79d014d47e867441b1ffecb18c828b2a5994b693b52","cross_cats_sorted":["cs.CR","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2013-02-28T17:15:44Z","title_canon_sha256":"04dfbed214dae2c683f44d813ba0ee32b7523201e87578d2def8c55c2a40bf16"},"schema_version":"1.0","source":{"id":"1302.7262","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.7262","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1302.7262v6","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.7262","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"7WEHUIJTCOBV","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7WEHUIJTCOBV767W","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7WEHUIJT","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:e9d64312ab41cfe9b00ac72221ab59e7c560c7a3537b3362142f94bccb7fd88e","target":"graph","created_at":"2026-05-18T03:03:21Z","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":"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","authors_text":"Davidson Boccardo, Jayme L. Szwarcfiter, Lucila M. S. Bento, Raphael C. S. Machado, Vin\\'icius G. Pereira de S\\'a","cross_cats":["cs.CR","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2013-02-28T17:15:44Z","title":"Towards a provably resilient scheme for graph-based watermarking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.7262","kind":"arxiv","version":6},"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:b06a972aac7d74f0edde3b077b20829ad50ca6592153864f1e45b9931f4733a8","target":"record","created_at":"2026-05-18T03:03:21Z","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":"f96ff4925c6a8c2194f2f79d014d47e867441b1ffecb18c828b2a5994b693b52","cross_cats_sorted":["cs.CR","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2013-02-28T17:15:44Z","title_canon_sha256":"04dfbed214dae2c683f44d813ba0ee32b7523201e87578d2def8c55c2a40bf16"},"schema_version":"1.0","source":{"id":"1302.7262","kind":"arxiv","version":6}},"canonical_sha256":"fd887a213313835ffbf6cc7fac9eb7cd0fc66effb1cd70220f975208c5e3fedd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd887a213313835ffbf6cc7fac9eb7cd0fc66effb1cd70220f975208c5e3fedd","first_computed_at":"2026-05-18T03:03:21.099311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:21.099311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"19GYFbulj5v5y6CyNoxu5lWlSWcKsgvkY+OXM6FeKeAk80m2j34hNV/JWx/1nxVFtDfna6aFWX/fG3HgWszxBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:21.099869Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.7262","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b06a972aac7d74f0edde3b077b20829ad50ca6592153864f1e45b9931f4733a8","sha256:e9d64312ab41cfe9b00ac72221ab59e7c560c7a3537b3362142f94bccb7fd88e"],"state_sha256":"977e61501fc950dbe7719d1ae00c7d525c8ce1a3ad56583a2df87124c13ee380"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6+rI+oPTj2Wb0t6NJ7Wtw2DZHixbyTtvWuuiBiTRDjODYuWuPaJ2Svatfy9s8O843V+EG/Q8hCBI8HtYrtL7CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:22:12.595902Z","bundle_sha256":"d4221b6f138d1082da8fccb10abca8f627af98c3e3a0c54ff137d0e4d11c008a"}}