{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CUUJFVDIYOBRFFYSGDW4ARPISQ","short_pith_number":"pith:CUUJFVDI","canonical_record":{"source":{"id":"1411.0763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-04T02:39:46Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"546853553a62b694c19c5a6f2feced0218da3ade87ba7ee4bbcd0a96a9c17feb","abstract_canon_sha256":"12ae730b4c320fe381c5088add44b7a3423798f608843fd25834551b5f50ca4d"},"schema_version":"1.0"},"canonical_sha256":"152892d468c38312971230edc045e894338f8f4ba67a9ea7c30ffb2335c3e1b5","source":{"kind":"arxiv","id":"1411.0763","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0763","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0763v1","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0763","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"pith_short_12","alias_value":"CUUJFVDIYOBR","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"CUUJFVDIYOBRFFYS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"CUUJFVDI","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CUUJFVDIYOBRFFYSGDW4ARPISQ","target":"record","payload":{"canonical_record":{"source":{"id":"1411.0763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-04T02:39:46Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"546853553a62b694c19c5a6f2feced0218da3ade87ba7ee4bbcd0a96a9c17feb","abstract_canon_sha256":"12ae730b4c320fe381c5088add44b7a3423798f608843fd25834551b5f50ca4d"},"schema_version":"1.0"},"canonical_sha256":"152892d468c38312971230edc045e894338f8f4ba67a9ea7c30ffb2335c3e1b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:38.309662Z","signature_b64":"3DAliHjBs7IqF0uNY3M04FcIsfpuIWvTJyUbf0njYCsOHb0UK6i0mQjbIQih3F9dEgtRCRbGSnVFlr2DQRUBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"152892d468c38312971230edc045e894338f8f4ba67a9ea7c30ffb2335c3e1b5","last_reissued_at":"2026-05-18T02:38:38.309267Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:38.309267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.0763","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-18T02:38:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P2yQjFQXQ+g5ruMG+byaPJMhiJkpcGskP8gEDXpmRg4Fy+FQj/XKQPjF3SwSsEgPxrknKQTZOssDB5UBbHSZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:04:04.022148Z"},"content_sha256":"762da95db7a803222226b57dfdea522178513e627ec4b3be34afeaa902d86777","schema_version":"1.0","event_id":"sha256:762da95db7a803222226b57dfdea522178513e627ec4b3be34afeaa902d86777"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CUUJFVDIYOBRFFYSGDW4ARPISQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Weighted Common Subgraph Matching Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DS","authors_text":"Hong Qiao, Xu Yang, Zhi-yong Liu","submitted_at":"2014-11-04T02:39:46Z","abstract_excerpt":"We propose a weighted common subgraph (WCS) matching algorithm to find the most similar subgraphs in two labeled weighted graphs. WCS matching, as a natural generalization of the equal-sized graph matching or subgraph matching, finds wide applications in many computer vision and machine learning tasks. In this paper, the WCS matching is first formulated as a combinatorial optimization problem over the set of partial permutation matrices. Then it is approximately solved by a recently proposed combinatorial optimization framework - Graduated NonConvexity and Concavity Procedure (GNCCP). Experime"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0763","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-18T02:38:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQtp4SS536/He7QGVp7sZYBYB6mBjlO8+xz0JSVGo7RMkJsm92OvDNgIrjNhxECjZoxzAT+Rkf07WPWiJSqWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:04:04.022851Z"},"content_sha256":"2e600eadfac91747310f99e91bcdd3f2a37b62a30bd056080a585ce74fcc38c4","schema_version":"1.0","event_id":"sha256:2e600eadfac91747310f99e91bcdd3f2a37b62a30bd056080a585ce74fcc38c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CUUJFVDIYOBRFFYSGDW4ARPISQ/bundle.json","state_url":"https://pith.science/pith/CUUJFVDIYOBRFFYSGDW4ARPISQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CUUJFVDIYOBRFFYSGDW4ARPISQ/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-05-27T08:04:04Z","links":{"resolver":"https://pith.science/pith/CUUJFVDIYOBRFFYSGDW4ARPISQ","bundle":"https://pith.science/pith/CUUJFVDIYOBRFFYSGDW4ARPISQ/bundle.json","state":"https://pith.science/pith/CUUJFVDIYOBRFFYSGDW4ARPISQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CUUJFVDIYOBRFFYSGDW4ARPISQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CUUJFVDIYOBRFFYSGDW4ARPISQ","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":"12ae730b4c320fe381c5088add44b7a3423798f608843fd25834551b5f50ca4d","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-04T02:39:46Z","title_canon_sha256":"546853553a62b694c19c5a6f2feced0218da3ade87ba7ee4bbcd0a96a9c17feb"},"schema_version":"1.0","source":{"id":"1411.0763","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0763","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0763v1","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0763","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"pith_short_12","alias_value":"CUUJFVDIYOBR","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"CUUJFVDIYOBRFFYS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"CUUJFVDI","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:2e600eadfac91747310f99e91bcdd3f2a37b62a30bd056080a585ce74fcc38c4","target":"graph","created_at":"2026-05-18T02:38:38Z","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 propose a weighted common subgraph (WCS) matching algorithm to find the most similar subgraphs in two labeled weighted graphs. WCS matching, as a natural generalization of the equal-sized graph matching or subgraph matching, finds wide applications in many computer vision and machine learning tasks. In this paper, the WCS matching is first formulated as a combinatorial optimization problem over the set of partial permutation matrices. Then it is approximately solved by a recently proposed combinatorial optimization framework - Graduated NonConvexity and Concavity Procedure (GNCCP). Experime","authors_text":"Hong Qiao, Xu Yang, Zhi-yong Liu","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-04T02:39:46Z","title":"A Weighted Common Subgraph Matching Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0763","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:762da95db7a803222226b57dfdea522178513e627ec4b3be34afeaa902d86777","target":"record","created_at":"2026-05-18T02:38:38Z","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":"12ae730b4c320fe381c5088add44b7a3423798f608843fd25834551b5f50ca4d","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-04T02:39:46Z","title_canon_sha256":"546853553a62b694c19c5a6f2feced0218da3ade87ba7ee4bbcd0a96a9c17feb"},"schema_version":"1.0","source":{"id":"1411.0763","kind":"arxiv","version":1}},"canonical_sha256":"152892d468c38312971230edc045e894338f8f4ba67a9ea7c30ffb2335c3e1b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"152892d468c38312971230edc045e894338f8f4ba67a9ea7c30ffb2335c3e1b5","first_computed_at":"2026-05-18T02:38:38.309267Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:38.309267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3DAliHjBs7IqF0uNY3M04FcIsfpuIWvTJyUbf0njYCsOHb0UK6i0mQjbIQih3F9dEgtRCRbGSnVFlr2DQRUBBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:38.309662Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0763","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:762da95db7a803222226b57dfdea522178513e627ec4b3be34afeaa902d86777","sha256:2e600eadfac91747310f99e91bcdd3f2a37b62a30bd056080a585ce74fcc38c4"],"state_sha256":"af30a8e491cfaef25c60510b07f9df15a787417afcbd8d0bc9d3d8a84c57f01b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0qrqqwORzE60jLYVid5QN9/82uLriBcibG817mt09zUMqNDH3E5+Tl26F2ESlnNKF+Q5nU8+cq5EmZOENM+7AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:04:04.026534Z","bundle_sha256":"f04d7a64ea7a79b9229373f39df8d2fa4349ffe5b361902653263e12ae55ceb0"}}