{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RRTSUW7TEKGFWYB6VFP5U7XH4I","short_pith_number":"pith:RRTSUW7T","canonical_record":{"source":{"id":"1605.09425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2016-05-30T21:46:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a1e36644539490e4613d2fe696b6ed0d59876dd4bf0e787304bb279dfd6aaabc","abstract_canon_sha256":"e51435f08434d7b627da9d2ad12e990a414025c70fccc764e5376be633c23d17"},"schema_version":"1.0"},"canonical_sha256":"8c672a5bf3228c5b603ea95fda7ee7e205e5a9ea4902f1f5566abaa58a37d811","source":{"kind":"arxiv","id":"1605.09425","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09425","created_at":"2026-05-18T01:13:17Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09425v1","created_at":"2026-05-18T01:13:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09425","created_at":"2026-05-18T01:13:17Z"},{"alias_kind":"pith_short_12","alias_value":"RRTSUW7TEKGF","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RRTSUW7TEKGFWYB6","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RRTSUW7T","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RRTSUW7TEKGFWYB6VFP5U7XH4I","target":"record","payload":{"canonical_record":{"source":{"id":"1605.09425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2016-05-30T21:46:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a1e36644539490e4613d2fe696b6ed0d59876dd4bf0e787304bb279dfd6aaabc","abstract_canon_sha256":"e51435f08434d7b627da9d2ad12e990a414025c70fccc764e5376be633c23d17"},"schema_version":"1.0"},"canonical_sha256":"8c672a5bf3228c5b603ea95fda7ee7e205e5a9ea4902f1f5566abaa58a37d811","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:17.369152Z","signature_b64":"jPLnXo019nSQ6CZBnywormgt+QgsYlJYenC6b7N4JG/cN2PNjFX4d042a/qjIY4gRvEzm15R3AXFYZ9TLHUCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c672a5bf3228c5b603ea95fda7ee7e205e5a9ea4902f1f5566abaa58a37d811","last_reissued_at":"2026-05-18T01:13:17.368726Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:17.368726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.09425","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-18T01:13:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aRXb2zUl9Yo9kSipOF/KMqXCpPzHdd8K631s7lL8aHovt3iGRMlXWdvkQY/OT3dc81t2azygE/FnOlYcyhTyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:10:37.417730Z"},"content_sha256":"78eb31d6ab19bc2108fdc870977f1693abba9b9d549af0727e9237633c76c6a4","schema_version":"1.0","event_id":"sha256:78eb31d6ab19bc2108fdc870977f1693abba9b9d549af0727e9237633c76c6a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RRTSUW7TEKGFWYB6VFP5U7XH4I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Models and Algorithms for Graph Watermarking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.MM","authors_text":"David Eppstein, Jenny Lam, Manuel Torres, Michael Mitzenmacher, Michael T. Goodrich, Nil Mamano","submitted_at":"2016-05-30T21:46:31Z","abstract_excerpt":"We introduce models and algorithmic foundations for graph watermarking. Our frameworks include security definitions and proofs, as well as characterizations when graph watermarking is algorithmically feasible, in spite of the fact that the general problem is NP-complete by simple reductions from the subgraph isomorphism or graph edit distance problems. In the digital watermarking of many types of files, an implicit step in the recovery of a watermark is the mapping of individual pieces of data, such as image pixels or movie frames, from one object to another. In graphs, this step corresponds t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09425","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-18T01:13:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wwimNjPI7CInkG9cMuo3ilaHAFrPXtvH6yctBbNbEtSTygZlh79ifAlZshNAxfV7PV84IUyLwM74XL67q+9tCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:10:37.418073Z"},"content_sha256":"53914d1a5febf15e0d52e18cd92e7cfac6a405dc6f08c0ce5599a6e086bf7700","schema_version":"1.0","event_id":"sha256:53914d1a5febf15e0d52e18cd92e7cfac6a405dc6f08c0ce5599a6e086bf7700"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RRTSUW7TEKGFWYB6VFP5U7XH4I/bundle.json","state_url":"https://pith.science/pith/RRTSUW7TEKGFWYB6VFP5U7XH4I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RRTSUW7TEKGFWYB6VFP5U7XH4I/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-24T07:10:37Z","links":{"resolver":"https://pith.science/pith/RRTSUW7TEKGFWYB6VFP5U7XH4I","bundle":"https://pith.science/pith/RRTSUW7TEKGFWYB6VFP5U7XH4I/bundle.json","state":"https://pith.science/pith/RRTSUW7TEKGFWYB6VFP5U7XH4I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RRTSUW7TEKGFWYB6VFP5U7XH4I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RRTSUW7TEKGFWYB6VFP5U7XH4I","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":"e51435f08434d7b627da9d2ad12e990a414025c70fccc764e5376be633c23d17","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2016-05-30T21:46:31Z","title_canon_sha256":"a1e36644539490e4613d2fe696b6ed0d59876dd4bf0e787304bb279dfd6aaabc"},"schema_version":"1.0","source":{"id":"1605.09425","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09425","created_at":"2026-05-18T01:13:17Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09425v1","created_at":"2026-05-18T01:13:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09425","created_at":"2026-05-18T01:13:17Z"},{"alias_kind":"pith_short_12","alias_value":"RRTSUW7TEKGF","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RRTSUW7TEKGFWYB6","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RRTSUW7T","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:53914d1a5febf15e0d52e18cd92e7cfac6a405dc6f08c0ce5599a6e086bf7700","target":"graph","created_at":"2026-05-18T01:13:17Z","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":"We introduce models and algorithmic foundations for graph watermarking. Our frameworks include security definitions and proofs, as well as characterizations when graph watermarking is algorithmically feasible, in spite of the fact that the general problem is NP-complete by simple reductions from the subgraph isomorphism or graph edit distance problems. In the digital watermarking of many types of files, an implicit step in the recovery of a watermark is the mapping of individual pieces of data, such as image pixels or movie frames, from one object to another. In graphs, this step corresponds t","authors_text":"David Eppstein, Jenny Lam, Manuel Torres, Michael Mitzenmacher, Michael T. Goodrich, Nil Mamano","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2016-05-30T21:46:31Z","title":"Models and Algorithms for Graph Watermarking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09425","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:78eb31d6ab19bc2108fdc870977f1693abba9b9d549af0727e9237633c76c6a4","target":"record","created_at":"2026-05-18T01:13:17Z","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":"e51435f08434d7b627da9d2ad12e990a414025c70fccc764e5376be633c23d17","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2016-05-30T21:46:31Z","title_canon_sha256":"a1e36644539490e4613d2fe696b6ed0d59876dd4bf0e787304bb279dfd6aaabc"},"schema_version":"1.0","source":{"id":"1605.09425","kind":"arxiv","version":1}},"canonical_sha256":"8c672a5bf3228c5b603ea95fda7ee7e205e5a9ea4902f1f5566abaa58a37d811","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c672a5bf3228c5b603ea95fda7ee7e205e5a9ea4902f1f5566abaa58a37d811","first_computed_at":"2026-05-18T01:13:17.368726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:17.368726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jPLnXo019nSQ6CZBnywormgt+QgsYlJYenC6b7N4JG/cN2PNjFX4d042a/qjIY4gRvEzm15R3AXFYZ9TLHUCBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:17.369152Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.09425","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78eb31d6ab19bc2108fdc870977f1693abba9b9d549af0727e9237633c76c6a4","sha256:53914d1a5febf15e0d52e18cd92e7cfac6a405dc6f08c0ce5599a6e086bf7700"],"state_sha256":"f1ed922721bc7c48c3f95ab2d4d069275d1427e5192c98c6274d7dcafaae76bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L1cInS/vAtJ8d/EloJZYxHXGXIjDbHghS068/4wz3um7q6G8lkLApdn6YAKwRAkGFTwJO9MbiUTuMsuuP6LdCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:10:37.419969Z","bundle_sha256":"f2b36ca8ff49578ad3c6bbce8ca6c519220b7fbe98d070f9b64587a651c54259"}}