{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SEDEN5H6VTBOOWM6ND7C6YE573","short_pith_number":"pith:SEDEN5H6","canonical_record":{"source":{"id":"1702.00391","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-01T18:53:53Z","cross_cats_sorted":[],"title_canon_sha256":"bb65c0f5a709b886cf5421796cecf9d239479f7545cc4e7f5f7ea564bdf4ae77","abstract_canon_sha256":"fc44ab35ae3dfeda0174ee91cc664328542ea294c54d0d21880447cec684c978"},"schema_version":"1.0"},"canonical_sha256":"910646f4feacc2e7599e68fe2f609dfefca3a0bdb2694a4307cbd73dfdef94ad","source":{"kind":"arxiv","id":"1702.00391","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00391","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00391v1","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00391","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"SEDEN5H6VTBO","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SEDEN5H6VTBOOWM6","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SEDEN5H6","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SEDEN5H6VTBOOWM6ND7C6YE573","target":"record","payload":{"canonical_record":{"source":{"id":"1702.00391","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-01T18:53:53Z","cross_cats_sorted":[],"title_canon_sha256":"bb65c0f5a709b886cf5421796cecf9d239479f7545cc4e7f5f7ea564bdf4ae77","abstract_canon_sha256":"fc44ab35ae3dfeda0174ee91cc664328542ea294c54d0d21880447cec684c978"},"schema_version":"1.0"},"canonical_sha256":"910646f4feacc2e7599e68fe2f609dfefca3a0bdb2694a4307cbd73dfdef94ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:34.499871Z","signature_b64":"zRjZ/cerMrz2zK2zCTLGKdCzeZWrUMytceDh4wjx2JCxLMblgLzxt6dk5/xdclxQ1kDzwG/MVe+6U09YMpg3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"910646f4feacc2e7599e68fe2f609dfefca3a0bdb2694a4307cbd73dfdef94ad","last_reissued_at":"2026-05-18T00:51:34.499492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:34.499492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.00391","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-18T00:51:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4RAqV+R0BblMO/rUq5guV/teBsywgeTiXdk95Fdsub66Z3NotHX5a6g2j80LbbdKB4f+9FQJg0oiAsCil5gNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:16:45.035973Z"},"content_sha256":"2f2a0c4c2c25399bdcc8f161077c666ba242a332b976c21cab960b7ecdd058a7","schema_version":"1.0","event_id":"sha256:2f2a0c4c2c25399bdcc8f161077c666ba242a332b976c21cab960b7ecdd058a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SEDEN5H6VTBOOWM6ND7C6YE573","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Product Graph-based Higher Order Contextual Similarities for Inexact Subgraph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anjan Dutta, Horst Bunke, Josep Llad\\'os, Umapada Pal","submitted_at":"2017-02-01T18:53:53Z","abstract_excerpt":"Many algorithms formulate graph matching as an optimization of an objective function of pairwise quantification of nodes and edges of two graphs to be matched. Pairwise measurements usually consider local attributes but disregard contextual information involved in graph structures. We address this issue by proposing contextual similarities between pairs of nodes. This is done by considering the tensor product graph (TPG) of two graphs to be matched, where each node is an ordered pair of nodes of the operand graphs. Contextual similarities between a pair of nodes are computed by accumulating we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00391","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-18T00:51:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jc5qebqY9fz2b8ZAFC9vAuM4IZHOL0dcg8fPNqb4DXU/ygDCXhcrCFo9chsEKQy7mhhboYtVn04u3rElY82RCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:16:45.036352Z"},"content_sha256":"fc39fea086e092fcc79778a0a5fc916859f95d1681363382b98d7938589e1562","schema_version":"1.0","event_id":"sha256:fc39fea086e092fcc79778a0a5fc916859f95d1681363382b98d7938589e1562"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SEDEN5H6VTBOOWM6ND7C6YE573/bundle.json","state_url":"https://pith.science/pith/SEDEN5H6VTBOOWM6ND7C6YE573/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SEDEN5H6VTBOOWM6ND7C6YE573/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-26T23:16:45Z","links":{"resolver":"https://pith.science/pith/SEDEN5H6VTBOOWM6ND7C6YE573","bundle":"https://pith.science/pith/SEDEN5H6VTBOOWM6ND7C6YE573/bundle.json","state":"https://pith.science/pith/SEDEN5H6VTBOOWM6ND7C6YE573/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SEDEN5H6VTBOOWM6ND7C6YE573/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SEDEN5H6VTBOOWM6ND7C6YE573","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":"fc44ab35ae3dfeda0174ee91cc664328542ea294c54d0d21880447cec684c978","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-01T18:53:53Z","title_canon_sha256":"bb65c0f5a709b886cf5421796cecf9d239479f7545cc4e7f5f7ea564bdf4ae77"},"schema_version":"1.0","source":{"id":"1702.00391","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00391","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00391v1","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00391","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"SEDEN5H6VTBO","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SEDEN5H6VTBOOWM6","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SEDEN5H6","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:fc39fea086e092fcc79778a0a5fc916859f95d1681363382b98d7938589e1562","target":"graph","created_at":"2026-05-18T00:51:34Z","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":"Many algorithms formulate graph matching as an optimization of an objective function of pairwise quantification of nodes and edges of two graphs to be matched. Pairwise measurements usually consider local attributes but disregard contextual information involved in graph structures. We address this issue by proposing contextual similarities between pairs of nodes. This is done by considering the tensor product graph (TPG) of two graphs to be matched, where each node is an ordered pair of nodes of the operand graphs. Contextual similarities between a pair of nodes are computed by accumulating we","authors_text":"Anjan Dutta, Horst Bunke, Josep Llad\\'os, Umapada Pal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-01T18:53:53Z","title":"Product Graph-based Higher Order Contextual Similarities for Inexact Subgraph Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00391","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:2f2a0c4c2c25399bdcc8f161077c666ba242a332b976c21cab960b7ecdd058a7","target":"record","created_at":"2026-05-18T00:51:34Z","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":"fc44ab35ae3dfeda0174ee91cc664328542ea294c54d0d21880447cec684c978","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-01T18:53:53Z","title_canon_sha256":"bb65c0f5a709b886cf5421796cecf9d239479f7545cc4e7f5f7ea564bdf4ae77"},"schema_version":"1.0","source":{"id":"1702.00391","kind":"arxiv","version":1}},"canonical_sha256":"910646f4feacc2e7599e68fe2f609dfefca3a0bdb2694a4307cbd73dfdef94ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"910646f4feacc2e7599e68fe2f609dfefca3a0bdb2694a4307cbd73dfdef94ad","first_computed_at":"2026-05-18T00:51:34.499492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:34.499492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zRjZ/cerMrz2zK2zCTLGKdCzeZWrUMytceDh4wjx2JCxLMblgLzxt6dk5/xdclxQ1kDzwG/MVe+6U09YMpg3Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:34.499871Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.00391","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f2a0c4c2c25399bdcc8f161077c666ba242a332b976c21cab960b7ecdd058a7","sha256:fc39fea086e092fcc79778a0a5fc916859f95d1681363382b98d7938589e1562"],"state_sha256":"c2ac1dd7e5c43ec26c51acfcf014e2c0421c0cbe1955ba19db2c708d10d56314"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EiEe/JctFJr0Y2LMiczUry3qUul2j3hsqGbz9XooLep5CGovdd0rZkNjfqlwQd9X3bYHa8q2gPMISrQfzkMxCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:16:45.039366Z","bundle_sha256":"793ad11b2b417596b3c60f7622315af97257d80a73ab11bf9ef0fa4dae50fe8a"}}