{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VTOKY5L42DARLTM4I62T6JF4HB","short_pith_number":"pith:VTOKY5L4","canonical_record":{"source":{"id":"1802.06060","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-02-16T18:21:54Z","cross_cats_sorted":["cs.DB","cs.DS"],"title_canon_sha256":"f77eedde90f6bb292957f523983e8bdefb949f58b35fbfe4c9565870961c98e3","abstract_canon_sha256":"892f5fa95beef19ee37e0634507fbd0a77458414e9a522c6663afffd0c4c1b74"},"schema_version":"1.0"},"canonical_sha256":"acdcac757cd0c115cd9c47b53f24bc385ba84ff5aea09582dcb564ed49d9bc9a","source":{"kind":"arxiv","id":"1802.06060","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06060","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06060v3","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06060","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"VTOKY5L42DAR","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VTOKY5L42DARLTM4","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VTOKY5L4","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VTOKY5L42DARLTM4I62T6JF4HB","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06060","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-02-16T18:21:54Z","cross_cats_sorted":["cs.DB","cs.DS"],"title_canon_sha256":"f77eedde90f6bb292957f523983e8bdefb949f58b35fbfe4c9565870961c98e3","abstract_canon_sha256":"892f5fa95beef19ee37e0634507fbd0a77458414e9a522c6663afffd0c4c1b74"},"schema_version":"1.0"},"canonical_sha256":"acdcac757cd0c115cd9c47b53f24bc385ba84ff5aea09582dcb564ed49d9bc9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:45.703622Z","signature_b64":"azlt73Pehb+hIWKE+rvKimS6uwYKkx+cAr7Lq784IxFDZTjF70xtoxvnkldcnBYe39I2PiTkjMy+o11QmtnBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acdcac757cd0c115cd9c47b53f24bc385ba84ff5aea09582dcb564ed49d9bc9a","last_reissued_at":"2026-05-18T00:18:45.703138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:45.703138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06060","source_version":3,"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:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IXTyJwIpne5Yg8NFOY1VynK4owEcwdtL9DjJkiUEV8aEsqzku6TGSya4edSaVO+Py1n6MZbi4q24+cKMT5nwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:53:00.181925Z"},"content_sha256":"195b136c138a7b9f6762c39c3a85f05637039a3a4ac7cdbadfdfc7e1d6427c3b","schema_version":"1.0","event_id":"sha256:195b136c138a7b9f6762c39c3a85f05637039a3a4ac7cdbadfdfc7e1d6427c3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VTOKY5L42DARLTM4I62T6JF4HB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"cs.SI","authors_text":"Alessandra Sala, Deepak Ajwani, Mirek Riedewald, Patrick K. Nicholson, Wolfgang Gatterbauer, Xiaofeng Yang","submitted_at":"2018-02-16T18:21:54Z","abstract_excerpt":"Many problems in areas as diverse as recommendation systems, social network analysis, semantic search, and distributed root cause analysis can be modeled as pattern search on labeled graphs (also called \"heterogeneous information networks\" or HINs). Given a large graph and a query pattern with node and edge label constraints, a fundamental challenge is to nd the top-k matches ac- cording to a ranking function over edge and node weights. For users, it is di cult to select value k . We therefore propose the novel notion of an any-k ranking algorithm: for a given time budget, re- turn as many of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06060","kind":"arxiv","version":3},"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:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TjcrI5+Z0Kc85y59jGCGerU9UMKdyL+BgTBucQJi0JAWRDkAe+9eycJd+9zrpjyCesla19LgNzS+xR9S+rB3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:53:00.182849Z"},"content_sha256":"cb7f0c987853084a2f3d1494937f10f1646b93226433447dd471b63fa520973d","schema_version":"1.0","event_id":"sha256:cb7f0c987853084a2f3d1494937f10f1646b93226433447dd471b63fa520973d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTOKY5L42DARLTM4I62T6JF4HB/bundle.json","state_url":"https://pith.science/pith/VTOKY5L42DARLTM4I62T6JF4HB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTOKY5L42DARLTM4I62T6JF4HB/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-05T21:53:00Z","links":{"resolver":"https://pith.science/pith/VTOKY5L42DARLTM4I62T6JF4HB","bundle":"https://pith.science/pith/VTOKY5L42DARLTM4I62T6JF4HB/bundle.json","state":"https://pith.science/pith/VTOKY5L42DARLTM4I62T6JF4HB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTOKY5L42DARLTM4I62T6JF4HB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VTOKY5L42DARLTM4I62T6JF4HB","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":"892f5fa95beef19ee37e0634507fbd0a77458414e9a522c6663afffd0c4c1b74","cross_cats_sorted":["cs.DB","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-02-16T18:21:54Z","title_canon_sha256":"f77eedde90f6bb292957f523983e8bdefb949f58b35fbfe4c9565870961c98e3"},"schema_version":"1.0","source":{"id":"1802.06060","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06060","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06060v3","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06060","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"VTOKY5L42DAR","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VTOKY5L42DARLTM4","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VTOKY5L4","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:cb7f0c987853084a2f3d1494937f10f1646b93226433447dd471b63fa520973d","target":"graph","created_at":"2026-05-18T00:18:45Z","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 problems in areas as diverse as recommendation systems, social network analysis, semantic search, and distributed root cause analysis can be modeled as pattern search on labeled graphs (also called \"heterogeneous information networks\" or HINs). Given a large graph and a query pattern with node and edge label constraints, a fundamental challenge is to nd the top-k matches ac- cording to a ranking function over edge and node weights. For users, it is di cult to select value k . We therefore propose the novel notion of an any-k ranking algorithm: for a given time budget, re- turn as many of ","authors_text":"Alessandra Sala, Deepak Ajwani, Mirek Riedewald, Patrick K. Nicholson, Wolfgang Gatterbauer, Xiaofeng Yang","cross_cats":["cs.DB","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-02-16T18:21:54Z","title":"Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06060","kind":"arxiv","version":3},"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:195b136c138a7b9f6762c39c3a85f05637039a3a4ac7cdbadfdfc7e1d6427c3b","target":"record","created_at":"2026-05-18T00:18:45Z","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":"892f5fa95beef19ee37e0634507fbd0a77458414e9a522c6663afffd0c4c1b74","cross_cats_sorted":["cs.DB","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-02-16T18:21:54Z","title_canon_sha256":"f77eedde90f6bb292957f523983e8bdefb949f58b35fbfe4c9565870961c98e3"},"schema_version":"1.0","source":{"id":"1802.06060","kind":"arxiv","version":3}},"canonical_sha256":"acdcac757cd0c115cd9c47b53f24bc385ba84ff5aea09582dcb564ed49d9bc9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acdcac757cd0c115cd9c47b53f24bc385ba84ff5aea09582dcb564ed49d9bc9a","first_computed_at":"2026-05-18T00:18:45.703138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:45.703138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"azlt73Pehb+hIWKE+rvKimS6uwYKkx+cAr7Lq784IxFDZTjF70xtoxvnkldcnBYe39I2PiTkjMy+o11QmtnBCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:45.703622Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06060","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:195b136c138a7b9f6762c39c3a85f05637039a3a4ac7cdbadfdfc7e1d6427c3b","sha256:cb7f0c987853084a2f3d1494937f10f1646b93226433447dd471b63fa520973d"],"state_sha256":"9bb696b2938c106e0d1ac1fd32155d9211ee0bef4c48b24894599e9334580cdd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qi2Zrd+uTPmbkTwWbc+HAuSseDrRvi0g9FsfmIlYf74A0BjyDkInW9rpTzIh76mS33OOReOik+++3A8ceOsqCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:53:00.186326Z","bundle_sha256":"7734d75bc8015021e184a91ac5fd7c57c27d9fd10fb96da37abc83f26ffb6e3d"}}