{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5PMBQITQR4O3R2RGZXVPOGXHRW","short_pith_number":"pith:5PMBQITQ","canonical_record":{"source":{"id":"1412.5902","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2014-12-07T11:38:55Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"54e769afcdc52e81d11d1a1311d72ef5df2e6a4993ed34a4a6cd414739ef22b6","abstract_canon_sha256":"92f9c462a523f2e47517f343e02e08e68560d90fb4c614a39870b71f8fcdbce2"},"schema_version":"1.0"},"canonical_sha256":"ebd81822708f1db8ea26cdeaf71ae78db6635a860190ab17c53b74a6f9d28239","source":{"kind":"arxiv","id":"1412.5902","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5902","created_at":"2026-05-18T00:25:08Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5902v2","created_at":"2026-05-18T00:25:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5902","created_at":"2026-05-18T00:25:08Z"},{"alias_kind":"pith_short_12","alias_value":"5PMBQITQR4O3","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5PMBQITQR4O3R2RG","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5PMBQITQ","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5PMBQITQR4O3R2RGZXVPOGXHRW","target":"record","payload":{"canonical_record":{"source":{"id":"1412.5902","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2014-12-07T11:38:55Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"54e769afcdc52e81d11d1a1311d72ef5df2e6a4993ed34a4a6cd414739ef22b6","abstract_canon_sha256":"92f9c462a523f2e47517f343e02e08e68560d90fb4c614a39870b71f8fcdbce2"},"schema_version":"1.0"},"canonical_sha256":"ebd81822708f1db8ea26cdeaf71ae78db6635a860190ab17c53b74a6f9d28239","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:08.219544Z","signature_b64":"feSm1zZsKRDTOE05+xMdOBslUDxbI/QzyfgD7uiCSP9jB1uBDPdM2ND61wrHUtbl8+ISKXpQN8HXoGkvmrmuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebd81822708f1db8ea26cdeaf71ae78db6635a860190ab17c53b74a6f9d28239","last_reissued_at":"2026-05-18T00:25:08.219118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:08.219118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.5902","source_version":2,"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:25:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S1F+1ZNJ/R1zUPoX+VxU+uZBmnbaDKoYCC6j+2x5R/MYk/HF2Gn9JfuSx3ErCxF3KIClvgt3DjnqZeP1odEeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T05:00:27.228945Z"},"content_sha256":"71a41ce65858c457300c0e7d9f9502b77f70ae3b93a6046166ac4fdcb8458419","schema_version":"1.0","event_id":"sha256:71a41ce65858c457300c0e7d9f9502b77f70ae3b93a6046166ac4fdcb8458419"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5PMBQITQR4O3R2RGZXVPOGXHRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nearest Descent, In-Tree, and Clustering","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Chaoyi Li, Kaifu Yang, Teng Qiu, Yongjie Li","submitted_at":"2014-12-07T11:38:55Z","abstract_excerpt":"In this paper, we propose a physically inspired graph-theoretical clustering method, which first makes the data points organized into an attractive graph, called In-Tree, via a physically inspired rule, called Nearest Descent (ND). In particular, the rule of ND works to select the nearest node in the descending direction of potential as the parent node of each node, which is in essence different from the classical Gradient Descent or Steepest Descent. The constructed In-Tree proves a very good candidate for clustering due to its particular features and properties. In the In-Tree, the original "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5902","kind":"arxiv","version":2},"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:25:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3APDUxaYy/wXftOkucoKRZmW6uZdfibnBoqqn4gxr+uYEXTVR/XFqsP8RwltrQAp10AYSnJNimqoL38rMB37Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T05:00:27.229283Z"},"content_sha256":"7de56a41643932a8e59cc4a68730f323f3d0692309add8bcddb5616230f57d77","schema_version":"1.0","event_id":"sha256:7de56a41643932a8e59cc4a68730f323f3d0692309add8bcddb5616230f57d77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5PMBQITQR4O3R2RGZXVPOGXHRW/bundle.json","state_url":"https://pith.science/pith/5PMBQITQR4O3R2RGZXVPOGXHRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5PMBQITQR4O3R2RGZXVPOGXHRW/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-29T05:00:27Z","links":{"resolver":"https://pith.science/pith/5PMBQITQR4O3R2RGZXVPOGXHRW","bundle":"https://pith.science/pith/5PMBQITQR4O3R2RGZXVPOGXHRW/bundle.json","state":"https://pith.science/pith/5PMBQITQR4O3R2RGZXVPOGXHRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5PMBQITQR4O3R2RGZXVPOGXHRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5PMBQITQR4O3R2RGZXVPOGXHRW","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":"92f9c462a523f2e47517f343e02e08e68560d90fb4c614a39870b71f8fcdbce2","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2014-12-07T11:38:55Z","title_canon_sha256":"54e769afcdc52e81d11d1a1311d72ef5df2e6a4993ed34a4a6cd414739ef22b6"},"schema_version":"1.0","source":{"id":"1412.5902","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5902","created_at":"2026-05-18T00:25:08Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5902v2","created_at":"2026-05-18T00:25:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5902","created_at":"2026-05-18T00:25:08Z"},{"alias_kind":"pith_short_12","alias_value":"5PMBQITQR4O3","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5PMBQITQR4O3R2RG","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5PMBQITQ","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:7de56a41643932a8e59cc4a68730f323f3d0692309add8bcddb5616230f57d77","target":"graph","created_at":"2026-05-18T00:25:08Z","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":"In this paper, we propose a physically inspired graph-theoretical clustering method, which first makes the data points organized into an attractive graph, called In-Tree, via a physically inspired rule, called Nearest Descent (ND). In particular, the rule of ND works to select the nearest node in the descending direction of potential as the parent node of each node, which is in essence different from the classical Gradient Descent or Steepest Descent. The constructed In-Tree proves a very good candidate for clustering due to its particular features and properties. In the In-Tree, the original ","authors_text":"Chaoyi Li, Kaifu Yang, Teng Qiu, Yongjie Li","cross_cats":["cs.CV"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2014-12-07T11:38:55Z","title":"Nearest Descent, In-Tree, and Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5902","kind":"arxiv","version":2},"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:71a41ce65858c457300c0e7d9f9502b77f70ae3b93a6046166ac4fdcb8458419","target":"record","created_at":"2026-05-18T00:25:08Z","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":"92f9c462a523f2e47517f343e02e08e68560d90fb4c614a39870b71f8fcdbce2","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2014-12-07T11:38:55Z","title_canon_sha256":"54e769afcdc52e81d11d1a1311d72ef5df2e6a4993ed34a4a6cd414739ef22b6"},"schema_version":"1.0","source":{"id":"1412.5902","kind":"arxiv","version":2}},"canonical_sha256":"ebd81822708f1db8ea26cdeaf71ae78db6635a860190ab17c53b74a6f9d28239","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebd81822708f1db8ea26cdeaf71ae78db6635a860190ab17c53b74a6f9d28239","first_computed_at":"2026-05-18T00:25:08.219118Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:08.219118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"feSm1zZsKRDTOE05+xMdOBslUDxbI/QzyfgD7uiCSP9jB1uBDPdM2ND61wrHUtbl8+ISKXpQN8HXoGkvmrmuAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:08.219544Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.5902","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71a41ce65858c457300c0e7d9f9502b77f70ae3b93a6046166ac4fdcb8458419","sha256:7de56a41643932a8e59cc4a68730f323f3d0692309add8bcddb5616230f57d77"],"state_sha256":"fc7bae757a8ee3ab51535ab8283726e755048ef5e4c4ca59dfa970ae17c6f73d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zEFlmcoHvVLtZ7SXfjGezCbSsLYoSgSmOcAhfc6Y8/lN6Zdnymb9bf+skiMdEdd2cAzx7x/W0q1Hh/F8ltVfAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T05:00:27.231197Z","bundle_sha256":"58338070fd1ecac6a13524ad9fb8a742ea445ba07a09cdc504e4bc39dfe1e1dc"}}