{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZDWKEITVWOAJHHVQ2VZATIBKOD","short_pith_number":"pith:ZDWKEITV","canonical_record":{"source":{"id":"1612.04875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-12-14T23:11:49Z","cross_cats_sorted":[],"title_canon_sha256":"3f3b7f7bf4c93a91575d13504f0979b8e844f1d2d63580fcc3e7b643d01d7ae7","abstract_canon_sha256":"775454ded72a3d8cba8b5665cc2b06667d10fec891d6c5a49de68671a537d6f6"},"schema_version":"1.0"},"canonical_sha256":"c8eca22275b380939eb0d57209a02a70e04f63a6a9a9d45f2e53e48427a292b6","source":{"kind":"arxiv","id":"1612.04875","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04875","created_at":"2026-05-18T00:54:57Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04875v1","created_at":"2026-05-18T00:54:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04875","created_at":"2026-05-18T00:54:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZDWKEITVWOAJ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZDWKEITVWOAJHHVQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZDWKEITV","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZDWKEITVWOAJHHVQ2VZATIBKOD","target":"record","payload":{"canonical_record":{"source":{"id":"1612.04875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-12-14T23:11:49Z","cross_cats_sorted":[],"title_canon_sha256":"3f3b7f7bf4c93a91575d13504f0979b8e844f1d2d63580fcc3e7b643d01d7ae7","abstract_canon_sha256":"775454ded72a3d8cba8b5665cc2b06667d10fec891d6c5a49de68671a537d6f6"},"schema_version":"1.0"},"canonical_sha256":"c8eca22275b380939eb0d57209a02a70e04f63a6a9a9d45f2e53e48427a292b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:57.497839Z","signature_b64":"DU3mUkQiJbDIffqigdrtvThAl5/nWoSrP4bfa3amfsCE8BAvM/vFCZwh651WunKsfq0vB0z68agGlzSrKLXNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8eca22275b380939eb0d57209a02a70e04f63a6a9a9d45f2e53e48427a292b6","last_reissued_at":"2026-05-18T00:54:57.497392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:57.497392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.04875","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:54:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OvbLXbzlrUQOC8NXK4Yeapacgl9Vm8JgickzFWyb2rsa7UpYWG4thHSDzQAR6WAjeAiHbHff9ut0eINngvq1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:56:50.816378Z"},"content_sha256":"bf4061ed1debf464ef94110a73d3336ecb8bb6cad32e64ab8fc95856ad17af56","schema_version":"1.0","event_id":"sha256:bf4061ed1debf464ef94110a73d3336ecb8bb6cad32e64ab8fc95856ad17af56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZDWKEITVWOAJHHVQ2VZATIBKOD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Local Scaling using Conditional Quantiles of Graph Similarities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Bhavya Kailkhura, Jayaraman J. Thiagarajan, Karthikeyan Natesan Ramamurthy, Prasanna Sattigeri","submitted_at":"2016-12-14T23:11:49Z","abstract_excerpt":"Spectral analysis of neighborhood graphs is one of the most widely used techniques for exploratory data analysis, with applications ranging from machine learning to social sciences. In such applications, it is typical to first encode relationships between the data samples using an appropriate similarity function. Popular neighborhood construction techniques such as k-nearest neighbor (k-NN) graphs are known to be very sensitive to the choice of parameters, and more importantly susceptible to noise and varying densities. In this paper, we propose the use of quantile analysis to obtain local sca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04875","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:54:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lVTb/QU3nkYB/YtMcPW/J7wXzsRGheIzoEmXwK9p2kGQBvgGiDvQhW20ia+yula8CBGZJqQL277MBVSA64PKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:56:50.816725Z"},"content_sha256":"163bb2e8b49a08ce3e9c8c8adcdd79b9a80016948f4e2ae119d387f00b6c2e74","schema_version":"1.0","event_id":"sha256:163bb2e8b49a08ce3e9c8c8adcdd79b9a80016948f4e2ae119d387f00b6c2e74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZDWKEITVWOAJHHVQ2VZATIBKOD/bundle.json","state_url":"https://pith.science/pith/ZDWKEITVWOAJHHVQ2VZATIBKOD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZDWKEITVWOAJHHVQ2VZATIBKOD/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-28T14:56:50Z","links":{"resolver":"https://pith.science/pith/ZDWKEITVWOAJHHVQ2VZATIBKOD","bundle":"https://pith.science/pith/ZDWKEITVWOAJHHVQ2VZATIBKOD/bundle.json","state":"https://pith.science/pith/ZDWKEITVWOAJHHVQ2VZATIBKOD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZDWKEITVWOAJHHVQ2VZATIBKOD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZDWKEITVWOAJHHVQ2VZATIBKOD","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":"775454ded72a3d8cba8b5665cc2b06667d10fec891d6c5a49de68671a537d6f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-12-14T23:11:49Z","title_canon_sha256":"3f3b7f7bf4c93a91575d13504f0979b8e844f1d2d63580fcc3e7b643d01d7ae7"},"schema_version":"1.0","source":{"id":"1612.04875","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04875","created_at":"2026-05-18T00:54:57Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04875v1","created_at":"2026-05-18T00:54:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04875","created_at":"2026-05-18T00:54:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZDWKEITVWOAJ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZDWKEITVWOAJHHVQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZDWKEITV","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:163bb2e8b49a08ce3e9c8c8adcdd79b9a80016948f4e2ae119d387f00b6c2e74","target":"graph","created_at":"2026-05-18T00:54:57Z","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":"Spectral analysis of neighborhood graphs is one of the most widely used techniques for exploratory data analysis, with applications ranging from machine learning to social sciences. In such applications, it is typical to first encode relationships between the data samples using an appropriate similarity function. Popular neighborhood construction techniques such as k-nearest neighbor (k-NN) graphs are known to be very sensitive to the choice of parameters, and more importantly susceptible to noise and varying densities. In this paper, we propose the use of quantile analysis to obtain local sca","authors_text":"Bhavya Kailkhura, Jayaraman J. Thiagarajan, Karthikeyan Natesan Ramamurthy, Prasanna Sattigeri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-12-14T23:11:49Z","title":"Robust Local Scaling using Conditional Quantiles of Graph Similarities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04875","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:bf4061ed1debf464ef94110a73d3336ecb8bb6cad32e64ab8fc95856ad17af56","target":"record","created_at":"2026-05-18T00:54:57Z","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":"775454ded72a3d8cba8b5665cc2b06667d10fec891d6c5a49de68671a537d6f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-12-14T23:11:49Z","title_canon_sha256":"3f3b7f7bf4c93a91575d13504f0979b8e844f1d2d63580fcc3e7b643d01d7ae7"},"schema_version":"1.0","source":{"id":"1612.04875","kind":"arxiv","version":1}},"canonical_sha256":"c8eca22275b380939eb0d57209a02a70e04f63a6a9a9d45f2e53e48427a292b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8eca22275b380939eb0d57209a02a70e04f63a6a9a9d45f2e53e48427a292b6","first_computed_at":"2026-05-18T00:54:57.497392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:57.497392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DU3mUkQiJbDIffqigdrtvThAl5/nWoSrP4bfa3amfsCE8BAvM/vFCZwh651WunKsfq0vB0z68agGlzSrKLXNCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:57.497839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.04875","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf4061ed1debf464ef94110a73d3336ecb8bb6cad32e64ab8fc95856ad17af56","sha256:163bb2e8b49a08ce3e9c8c8adcdd79b9a80016948f4e2ae119d387f00b6c2e74"],"state_sha256":"40f68d82d3d38a9e0602a79495979fdb6147cf9bc6906647bac4f9874c48b94f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"04rVPdZRo5Vyx+gKE+cenF/m3B52rpCnPXVnx50tY0j1X8zF7+x1cYQbp7LRpwoZdoTHiNB7tmnxL8k4Ft5VCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:56:50.818651Z","bundle_sha256":"0743696dbe43636cfb9186ecdf6481f01622f77e99f98abe1670921cb436117d"}}