{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IPXMEFGMDNTOAK6V3VSCFZ7IES","short_pith_number":"pith:IPXMEFGM","canonical_record":{"source":{"id":"1707.04929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-07-16T19:02:31Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"04ed43d745099211c52e6dca9a59caca9c47b4bc762d3d46e3efb4642a8c353e","abstract_canon_sha256":"f7a2cf0157125c1763773ea8b16add91004de5804520e29c41e4591c5f97533c"},"schema_version":"1.0"},"canonical_sha256":"43eec214cc1b66e02bd5dd6422e7e824bd905a2632e78610f637022f7e6c17a4","source":{"kind":"arxiv","id":"1707.04929","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04929","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04929v1","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04929","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"IPXMEFGMDNTO","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IPXMEFGMDNTOAK6V","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IPXMEFGM","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IPXMEFGMDNTOAK6V3VSCFZ7IES","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-07-16T19:02:31Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"04ed43d745099211c52e6dca9a59caca9c47b4bc762d3d46e3efb4642a8c353e","abstract_canon_sha256":"f7a2cf0157125c1763773ea8b16add91004de5804520e29c41e4591c5f97533c"},"schema_version":"1.0"},"canonical_sha256":"43eec214cc1b66e02bd5dd6422e7e824bd905a2632e78610f637022f7e6c17a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:11.762973Z","signature_b64":"cFcRUm8iPKm+dv2y4Z1ZJWln2N/GIAYTzfdMAUkru0JMardXakpDr7lhXuEIT29CpEKSycNJUAUKi5j5o+TCAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43eec214cc1b66e02bd5dd6422e7e824bd905a2632e78610f637022f7e6c17a4","last_reissued_at":"2026-05-18T00:40:11.762415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:11.762415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04929","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:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+QFCLS00x8+Olj06mWXJRitl7DvCgu91y1ixz4aUgAP2NSpklrG8F+Gbfh1uAZ85MQbWZrNBsNI8LEBy7yQ1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:05:39.932075Z"},"content_sha256":"30fb7ceaa5a58aef2a5db56bcb0b467e197eb810732ac66420b7e82fd5034e19","schema_version":"1.0","event_id":"sha256:30fb7ceaa5a58aef2a5db56bcb0b467e197eb810732ac66420b7e82fd5034e19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IPXMEFGMDNTOAK6V3VSCFZ7IES","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Projected Power Iteration for Network Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"stat.CO","authors_text":"Efe Onaran, Soledad Villar","submitted_at":"2017-07-16T19:02:31Z","abstract_excerpt":"The network alignment problem asks for the best correspondence between two given graphs, so that the largest possible number of edges are matched. This problem appears in many scientific problems (like the study of protein-protein interactions) and it is very closely related to the quadratic assignment problem which has graph isomorphism, traveling salesman and minimum bisection problems as particular cases. The graph matching problem is NP-hard in general. However, under some restrictive models for the graphs, algorithms can approximate the alignment efficiently. In that spirit the recent wor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04929","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:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JZyyyAIj6J1CK+zFopjEyJznj2AdjvxJdQXjtKtfsDt/34XPTu+clgKTNqUZ1t2clcBIU+62ldR6NT4w3R9uCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:05:39.932806Z"},"content_sha256":"ecd120c52fd74ca147ecb43b80f73a9e5573b430f63794d59f9310d2ff0e2632","schema_version":"1.0","event_id":"sha256:ecd120c52fd74ca147ecb43b80f73a9e5573b430f63794d59f9310d2ff0e2632"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IPXMEFGMDNTOAK6V3VSCFZ7IES/bundle.json","state_url":"https://pith.science/pith/IPXMEFGMDNTOAK6V3VSCFZ7IES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IPXMEFGMDNTOAK6V3VSCFZ7IES/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-06T23:05:39Z","links":{"resolver":"https://pith.science/pith/IPXMEFGMDNTOAK6V3VSCFZ7IES","bundle":"https://pith.science/pith/IPXMEFGMDNTOAK6V3VSCFZ7IES/bundle.json","state":"https://pith.science/pith/IPXMEFGMDNTOAK6V3VSCFZ7IES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IPXMEFGMDNTOAK6V3VSCFZ7IES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IPXMEFGMDNTOAK6V3VSCFZ7IES","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":"f7a2cf0157125c1763773ea8b16add91004de5804520e29c41e4591c5f97533c","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-07-16T19:02:31Z","title_canon_sha256":"04ed43d745099211c52e6dca9a59caca9c47b4bc762d3d46e3efb4642a8c353e"},"schema_version":"1.0","source":{"id":"1707.04929","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04929","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04929v1","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04929","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"IPXMEFGMDNTO","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IPXMEFGMDNTOAK6V","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IPXMEFGM","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:ecd120c52fd74ca147ecb43b80f73a9e5573b430f63794d59f9310d2ff0e2632","target":"graph","created_at":"2026-05-18T00:40:11Z","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":"The network alignment problem asks for the best correspondence between two given graphs, so that the largest possible number of edges are matched. This problem appears in many scientific problems (like the study of protein-protein interactions) and it is very closely related to the quadratic assignment problem which has graph isomorphism, traveling salesman and minimum bisection problems as particular cases. The graph matching problem is NP-hard in general. However, under some restrictive models for the graphs, algorithms can approximate the alignment efficiently. In that spirit the recent wor","authors_text":"Efe Onaran, Soledad Villar","cross_cats":["cs.DS","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-07-16T19:02:31Z","title":"Projected Power Iteration for Network Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04929","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:30fb7ceaa5a58aef2a5db56bcb0b467e197eb810732ac66420b7e82fd5034e19","target":"record","created_at":"2026-05-18T00:40:11Z","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":"f7a2cf0157125c1763773ea8b16add91004de5804520e29c41e4591c5f97533c","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-07-16T19:02:31Z","title_canon_sha256":"04ed43d745099211c52e6dca9a59caca9c47b4bc762d3d46e3efb4642a8c353e"},"schema_version":"1.0","source":{"id":"1707.04929","kind":"arxiv","version":1}},"canonical_sha256":"43eec214cc1b66e02bd5dd6422e7e824bd905a2632e78610f637022f7e6c17a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43eec214cc1b66e02bd5dd6422e7e824bd905a2632e78610f637022f7e6c17a4","first_computed_at":"2026-05-18T00:40:11.762415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:11.762415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cFcRUm8iPKm+dv2y4Z1ZJWln2N/GIAYTzfdMAUkru0JMardXakpDr7lhXuEIT29CpEKSycNJUAUKi5j5o+TCAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:11.762973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04929","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30fb7ceaa5a58aef2a5db56bcb0b467e197eb810732ac66420b7e82fd5034e19","sha256:ecd120c52fd74ca147ecb43b80f73a9e5573b430f63794d59f9310d2ff0e2632"],"state_sha256":"88ef0fc088477944b51748ab0290ce216bc2f3c7e8532564e94ff4b613235309"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"po5RX0lfyjLIXveyEhLy0vF3CMVuqG3Ha6CZP8aBePwTLol1a+C9PewkzS1mxxWe1B1ZTdAQkosb+/STYZ/yDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T23:05:39.936425Z","bundle_sha256":"3406c4ead56d786d9a2528754e79f1befe4e20ca5153a2ffeadf04ac0f38c725"}}