{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZO7MFK7R3QQRIJKYUQYU7PQZ77","short_pith_number":"pith:ZO7MFK7R","canonical_record":{"source":{"id":"1601.06693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-25T17:43:38Z","cross_cats_sorted":["q-bio.QM","quant-ph"],"title_canon_sha256":"2c3b3dfbba872bdff8231873d79e88c28c6c96268f488753c87efc4a00b0cdba","abstract_canon_sha256":"f02d8a8aeb39912bd8308c639a36e3fac50fee91d966663a4c265b9c9d56f648"},"schema_version":"1.0"},"canonical_sha256":"cbbec2abf1dc21142558a4314fbe19ffe52fe43a5172cb2b71923420aef2aef3","source":{"kind":"arxiv","id":"1601.06693","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06693","created_at":"2026-05-18T01:22:03Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06693v1","created_at":"2026-05-18T01:22:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06693","created_at":"2026-05-18T01:22:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZO7MFK7R3QQR","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZO7MFK7R3QQRIJKY","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZO7MFK7R","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZO7MFK7R3QQRIJKYUQYU7PQZ77","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-25T17:43:38Z","cross_cats_sorted":["q-bio.QM","quant-ph"],"title_canon_sha256":"2c3b3dfbba872bdff8231873d79e88c28c6c96268f488753c87efc4a00b0cdba","abstract_canon_sha256":"f02d8a8aeb39912bd8308c639a36e3fac50fee91d966663a4c265b9c9d56f648"},"schema_version":"1.0"},"canonical_sha256":"cbbec2abf1dc21142558a4314fbe19ffe52fe43a5172cb2b71923420aef2aef3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:03.921220Z","signature_b64":"7tnmpJU8TS/qvqOoX6eSU47Kfw6EHciEOkcv6/jpcfQUMBlsNg49s14uACIIGSL7wmVVc6jorywkuyyu2toPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbbec2abf1dc21142558a4314fbe19ffe52fe43a5172cb2b71923420aef2aef3","last_reissued_at":"2026-05-18T01:22:03.920681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:03.920681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06693","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:22:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/eEiPyCHfqAc1bchjJef6GPUu4L+X4W+2BZ/xSn2aaUFOgIDkFUXK7clGFL1K6yNCkB+EBx/NkoUcL0gXnMMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:50:52.637093Z"},"content_sha256":"468373de29575fec6c33bf19b5c309be75eff4191126a2d939135e189f44a4ec","schema_version":"1.0","event_id":"sha256:468373de29575fec6c33bf19b5c309be75eff4191126a2d939135e189f44a4ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZO7MFK7R3QQRIJKYUQYU7PQZ77","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Graph-based Approach for Determining Molecular Similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM","quant-ph"],"primary_cat":"cs.DS","authors_text":"Arman Zaribafiyan, Maliheh Aramon, Maritza Hernandez, Mohammad Naghibi","submitted_at":"2016-01-25T17:43:38Z","abstract_excerpt":"In this paper, we tackle the problem of measuring similarity among graphs that represent real objects with noisy data. To account for noise, we relax the definition of similarity using the maximum weighted co-$k$-plex relaxation method, which allows dissimilarities among graphs up to a predetermined level. We then formulate the problem as a novel quadratic unconstrained binary optimization problem that can be solved by a quantum annealer. The context of our study is molecular similarity where the presence of noise might be due to regular errors in measuring molecular features. We develop a sim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06693","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:22:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FbuMEjvM+y9jzPFKNU9x8Y5M37xheJjHVasLmwT8FQ8hA6jMsljM3ahH+EhI+cU/gZM/IiAbKkmXg4/GNqbKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:50:52.637455Z"},"content_sha256":"f3d3a043439c44be44cf75d2b21d337f6d2bccd861d8c8d8370ddd96fab3bfe7","schema_version":"1.0","event_id":"sha256:f3d3a043439c44be44cf75d2b21d337f6d2bccd861d8c8d8370ddd96fab3bfe7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZO7MFK7R3QQRIJKYUQYU7PQZ77/bundle.json","state_url":"https://pith.science/pith/ZO7MFK7R3QQRIJKYUQYU7PQZ77/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZO7MFK7R3QQRIJKYUQYU7PQZ77/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-03T03:50:52Z","links":{"resolver":"https://pith.science/pith/ZO7MFK7R3QQRIJKYUQYU7PQZ77","bundle":"https://pith.science/pith/ZO7MFK7R3QQRIJKYUQYU7PQZ77/bundle.json","state":"https://pith.science/pith/ZO7MFK7R3QQRIJKYUQYU7PQZ77/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZO7MFK7R3QQRIJKYUQYU7PQZ77/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZO7MFK7R3QQRIJKYUQYU7PQZ77","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":"f02d8a8aeb39912bd8308c639a36e3fac50fee91d966663a4c265b9c9d56f648","cross_cats_sorted":["q-bio.QM","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-25T17:43:38Z","title_canon_sha256":"2c3b3dfbba872bdff8231873d79e88c28c6c96268f488753c87efc4a00b0cdba"},"schema_version":"1.0","source":{"id":"1601.06693","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06693","created_at":"2026-05-18T01:22:03Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06693v1","created_at":"2026-05-18T01:22:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06693","created_at":"2026-05-18T01:22:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZO7MFK7R3QQR","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZO7MFK7R3QQRIJKY","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZO7MFK7R","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:f3d3a043439c44be44cf75d2b21d337f6d2bccd861d8c8d8370ddd96fab3bfe7","target":"graph","created_at":"2026-05-18T01:22:03Z","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":"In this paper, we tackle the problem of measuring similarity among graphs that represent real objects with noisy data. To account for noise, we relax the definition of similarity using the maximum weighted co-$k$-plex relaxation method, which allows dissimilarities among graphs up to a predetermined level. We then formulate the problem as a novel quadratic unconstrained binary optimization problem that can be solved by a quantum annealer. The context of our study is molecular similarity where the presence of noise might be due to regular errors in measuring molecular features. We develop a sim","authors_text":"Arman Zaribafiyan, Maliheh Aramon, Maritza Hernandez, Mohammad Naghibi","cross_cats":["q-bio.QM","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-25T17:43:38Z","title":"A Novel Graph-based Approach for Determining Molecular Similarity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06693","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:468373de29575fec6c33bf19b5c309be75eff4191126a2d939135e189f44a4ec","target":"record","created_at":"2026-05-18T01:22:03Z","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":"f02d8a8aeb39912bd8308c639a36e3fac50fee91d966663a4c265b9c9d56f648","cross_cats_sorted":["q-bio.QM","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-25T17:43:38Z","title_canon_sha256":"2c3b3dfbba872bdff8231873d79e88c28c6c96268f488753c87efc4a00b0cdba"},"schema_version":"1.0","source":{"id":"1601.06693","kind":"arxiv","version":1}},"canonical_sha256":"cbbec2abf1dc21142558a4314fbe19ffe52fe43a5172cb2b71923420aef2aef3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbbec2abf1dc21142558a4314fbe19ffe52fe43a5172cb2b71923420aef2aef3","first_computed_at":"2026-05-18T01:22:03.920681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:03.920681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7tnmpJU8TS/qvqOoX6eSU47Kfw6EHciEOkcv6/jpcfQUMBlsNg49s14uACIIGSL7wmVVc6jorywkuyyu2toPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:03.921220Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06693","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:468373de29575fec6c33bf19b5c309be75eff4191126a2d939135e189f44a4ec","sha256:f3d3a043439c44be44cf75d2b21d337f6d2bccd861d8c8d8370ddd96fab3bfe7"],"state_sha256":"deb164ed079b26b0da3a7a7b27740e055a777b04b83c10655bd8c60e3c7a7371"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VWBt8NNZyTvZPrmhtTv0+UzgWv865yar6J51yj6Y6RE223s757Hc3KJldCPt6cNIALj5a3de1cxC5FtHPMSKDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:50:52.639416Z","bundle_sha256":"4ea17a82bde786575eb24732a3bd450490a4ae6ffe4bc390dc385e0b159c7710"}}