{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5BM2O6TEIGKWFWS6FWXGCH3F2U","short_pith_number":"pith:5BM2O6TE","canonical_record":{"source":{"id":"1607.00474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-07-02T07:41:45Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"3e48591eba0088bccee0b5decdc3c3ddd302a194d146aa63050897437f402141","abstract_canon_sha256":"2a597c56cd29f7dfde6fef04911dd98b3d9aeca7b49662d79fb1a80a8b9ede67"},"schema_version":"1.0"},"canonical_sha256":"e859a77a64419562da5e2dae611f65d5199b7ab06f3521fad28a7c22b576e330","source":{"kind":"arxiv","id":"1607.00474","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00474","created_at":"2026-05-18T01:11:36Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00474v1","created_at":"2026-05-18T01:11:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00474","created_at":"2026-05-18T01:11:36Z"},{"alias_kind":"pith_short_12","alias_value":"5BM2O6TEIGKW","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"5BM2O6TEIGKWFWS6","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"5BM2O6TE","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5BM2O6TEIGKWFWS6FWXGCH3F2U","target":"record","payload":{"canonical_record":{"source":{"id":"1607.00474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-07-02T07:41:45Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"3e48591eba0088bccee0b5decdc3c3ddd302a194d146aa63050897437f402141","abstract_canon_sha256":"2a597c56cd29f7dfde6fef04911dd98b3d9aeca7b49662d79fb1a80a8b9ede67"},"schema_version":"1.0"},"canonical_sha256":"e859a77a64419562da5e2dae611f65d5199b7ab06f3521fad28a7c22b576e330","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:36.995020Z","signature_b64":"WWLgbZBXFvncrEX4FSDAGKtDxVC3acR0UMLK/sfSJEl3YDpKCx05MrbBYkNJ7VVcHFF7lnwgpXk/sXN2vyxnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e859a77a64419562da5e2dae611f65d5199b7ab06f3521fad28a7c22b576e330","last_reissued_at":"2026-05-18T01:11:36.994628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:36.994628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.00474","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:11:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2rApwTUytNixD4Hs9K6rhGLkZZb4bAQkMcly+lmUuMa3ge1r1v1ruj8RfUD9j9tOj0NJOMSxkO6dC/SrUwRrDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:50:21.740850Z"},"content_sha256":"305279aedd39bed07e02d08583771069a844ea3aba0f4c39e35e5def645bea55","schema_version":"1.0","event_id":"sha256:305279aedd39bed07e02d08583771069a844ea3aba0f4c39e35e5def645bea55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5BM2O6TEIGKWFWS6FWXGCH3F2U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Neighborhood Graph Construction for Inference in Multi-Relational Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.SI","authors_text":"Dhanya Sridhar, Jay Pujara, Lise Getoor, Shobeir Fakhraei","submitted_at":"2016-07-02T07:41:45Z","abstract_excerpt":"A neighborhood graph, which represents the instances as vertices and their relations as weighted edges, is the basis of many semi-supervised and relational models for node labeling and link prediction. Most methods employ a sequential process to construct the neighborhood graph. This process often consists of generating a candidate graph, pruning the candidate graph to make a neighborhood graph, and then performing inference on the variables (i.e., nodes) in the neighborhood graph. In this paper, we propose a framework that can dynamically adapt the neighborhood graph based on the states of va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00474","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:11:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MY05qzGNXXla2MCf9HauRvU2s57IwuwFl0i8xdb5pWhPh/Mhopn9GcHrOygrbDXsmwX13Rd9ISTIRf7E/fOcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:50:21.741329Z"},"content_sha256":"0537c48ac19f81454023dcccbce03f211cb9d43fbb0aaeaafe604144cedc75dc","schema_version":"1.0","event_id":"sha256:0537c48ac19f81454023dcccbce03f211cb9d43fbb0aaeaafe604144cedc75dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BM2O6TEIGKWFWS6FWXGCH3F2U/bundle.json","state_url":"https://pith.science/pith/5BM2O6TEIGKWFWS6FWXGCH3F2U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BM2O6TEIGKWFWS6FWXGCH3F2U/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-28T16:50:21Z","links":{"resolver":"https://pith.science/pith/5BM2O6TEIGKWFWS6FWXGCH3F2U","bundle":"https://pith.science/pith/5BM2O6TEIGKWFWS6FWXGCH3F2U/bundle.json","state":"https://pith.science/pith/5BM2O6TEIGKWFWS6FWXGCH3F2U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BM2O6TEIGKWFWS6FWXGCH3F2U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5BM2O6TEIGKWFWS6FWXGCH3F2U","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":"2a597c56cd29f7dfde6fef04911dd98b3d9aeca7b49662d79fb1a80a8b9ede67","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-07-02T07:41:45Z","title_canon_sha256":"3e48591eba0088bccee0b5decdc3c3ddd302a194d146aa63050897437f402141"},"schema_version":"1.0","source":{"id":"1607.00474","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00474","created_at":"2026-05-18T01:11:36Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00474v1","created_at":"2026-05-18T01:11:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00474","created_at":"2026-05-18T01:11:36Z"},{"alias_kind":"pith_short_12","alias_value":"5BM2O6TEIGKW","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"5BM2O6TEIGKWFWS6","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"5BM2O6TE","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:0537c48ac19f81454023dcccbce03f211cb9d43fbb0aaeaafe604144cedc75dc","target":"graph","created_at":"2026-05-18T01:11:36Z","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":"A neighborhood graph, which represents the instances as vertices and their relations as weighted edges, is the basis of many semi-supervised and relational models for node labeling and link prediction. Most methods employ a sequential process to construct the neighborhood graph. This process often consists of generating a candidate graph, pruning the candidate graph to make a neighborhood graph, and then performing inference on the variables (i.e., nodes) in the neighborhood graph. In this paper, we propose a framework that can dynamically adapt the neighborhood graph based on the states of va","authors_text":"Dhanya Sridhar, Jay Pujara, Lise Getoor, Shobeir Fakhraei","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-07-02T07:41:45Z","title":"Adaptive Neighborhood Graph Construction for Inference in Multi-Relational Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00474","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:305279aedd39bed07e02d08583771069a844ea3aba0f4c39e35e5def645bea55","target":"record","created_at":"2026-05-18T01:11:36Z","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":"2a597c56cd29f7dfde6fef04911dd98b3d9aeca7b49662d79fb1a80a8b9ede67","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-07-02T07:41:45Z","title_canon_sha256":"3e48591eba0088bccee0b5decdc3c3ddd302a194d146aa63050897437f402141"},"schema_version":"1.0","source":{"id":"1607.00474","kind":"arxiv","version":1}},"canonical_sha256":"e859a77a64419562da5e2dae611f65d5199b7ab06f3521fad28a7c22b576e330","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e859a77a64419562da5e2dae611f65d5199b7ab06f3521fad28a7c22b576e330","first_computed_at":"2026-05-18T01:11:36.994628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:36.994628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WWLgbZBXFvncrEX4FSDAGKtDxVC3acR0UMLK/sfSJEl3YDpKCx05MrbBYkNJ7VVcHFF7lnwgpXk/sXN2vyxnBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:36.995020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00474","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:305279aedd39bed07e02d08583771069a844ea3aba0f4c39e35e5def645bea55","sha256:0537c48ac19f81454023dcccbce03f211cb9d43fbb0aaeaafe604144cedc75dc"],"state_sha256":"88e3559c5f551988e8709c0cd424747894cf73f2194d21f5b8c627dd82cb9eff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1O8bnSKwE33ptZDe3y0XVadoZRso7PO/OwuDBosbhiPMQ3W16ZfYOzROErduRw7H6/pkZu0VL85b8rCyjHXZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:50:21.743874Z","bundle_sha256":"98c0745bcfb9d4c1027340776304af77b43d7257905a48008cb50410bc0419af"}}