{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LZAAQ55FPLXOPINWLHW3JB6ZYW","short_pith_number":"pith:LZAAQ55F","canonical_record":{"source":{"id":"1505.02251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-09T09:39:04Z","cross_cats_sorted":["cs.CL","cs.IR"],"title_canon_sha256":"af3c760491377962869fe9a3c103424d3ae8a46b666e65546f2e26ca07abdf7f","abstract_canon_sha256":"ea4d8dad03c524fcbc2d936e0ea6368025bb93a9572ba21f006ac9d685d6a2e9"},"schema_version":"1.0"},"canonical_sha256":"5e400877a57aeee7a1b659edb487d9c581d9966cd4635530d698f181f554df9d","source":{"kind":"arxiv","id":"1505.02251","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02251","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02251v1","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02251","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"LZAAQ55FPLXO","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LZAAQ55FPLXOPINW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LZAAQ55F","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LZAAQ55FPLXOPINWLHW3JB6ZYW","target":"record","payload":{"canonical_record":{"source":{"id":"1505.02251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-09T09:39:04Z","cross_cats_sorted":["cs.CL","cs.IR"],"title_canon_sha256":"af3c760491377962869fe9a3c103424d3ae8a46b666e65546f2e26ca07abdf7f","abstract_canon_sha256":"ea4d8dad03c524fcbc2d936e0ea6368025bb93a9572ba21f006ac9d685d6a2e9"},"schema_version":"1.0"},"canonical_sha256":"5e400877a57aeee7a1b659edb487d9c581d9966cd4635530d698f181f554df9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:19.446116Z","signature_b64":"YKbZP5WT7n/p/vEg3PZxXxwNLXSe/xum9rCqKgnxsayj+k/F+jF7SJ3+nXmY7o6Z8WTXGelOCwDsGkwcGiWgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e400877a57aeee7a1b659edb487d9c581d9966cd4635530d698f181f554df9d","last_reissued_at":"2026-05-18T02:16:19.445627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:19.445627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.02251","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-18T02:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DFLX+KRSjcU82eNppuoNMCsY8gmo5xhTR+8gWqvUrABmpsy3TO909eKfCsSF6IdELL2QruZcolBALZwwgTNPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:15:46.459085Z"},"content_sha256":"ce9028d69c11cb9712cf4fdf4269cc1e10a10b9b037ecf122be83c72c8609a89","schema_version":"1.0","event_id":"sha256:ce9028d69c11cb9712cf4fdf4269cc1e10a10b9b037ecf122be83c72c8609a89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LZAAQ55FPLXOPINWLHW3JB6ZYW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Cascading for Large Scale Hierarchical Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.IR"],"primary_cat":"cs.LG","authors_text":"Aris Kosmopoulos, Georgios Paliouras, Ion Androutsopoulos","submitted_at":"2015-05-09T09:39:04Z","abstract_excerpt":"Hierarchies are frequently used for the organization of objects. Given a hierarchy of classes, two main approaches are used, to automatically classify new instances: flat classification and cascade classification. Flat classification ignores the hierarchy, while cascade classification greedily traverses the hierarchy from the root to the predicted leaf. In this paper we propose a new approach, which extends cascade classification to predict the right leaf by estimating the probability of each root-to-leaf path. We provide experimental results which indicate that, using the same classification "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02251","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-18T02:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hwPdCcFQDSt29HxDI62FjNvAfFlb/Na7GXJvNS+ItOuw+/3CHJrKPLi3sygMtiOq9L/NWL/2h+PiN+NGe3vCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:15:46.459443Z"},"content_sha256":"6cb4c71e3f0dc62ddf622ee3c0cff78602519518708037abce07893d21339eec","schema_version":"1.0","event_id":"sha256:6cb4c71e3f0dc62ddf622ee3c0cff78602519518708037abce07893d21339eec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZAAQ55FPLXOPINWLHW3JB6ZYW/bundle.json","state_url":"https://pith.science/pith/LZAAQ55FPLXOPINWLHW3JB6ZYW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZAAQ55FPLXOPINWLHW3JB6ZYW/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-24T17:15:46Z","links":{"resolver":"https://pith.science/pith/LZAAQ55FPLXOPINWLHW3JB6ZYW","bundle":"https://pith.science/pith/LZAAQ55FPLXOPINWLHW3JB6ZYW/bundle.json","state":"https://pith.science/pith/LZAAQ55FPLXOPINWLHW3JB6ZYW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZAAQ55FPLXOPINWLHW3JB6ZYW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LZAAQ55FPLXOPINWLHW3JB6ZYW","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":"ea4d8dad03c524fcbc2d936e0ea6368025bb93a9572ba21f006ac9d685d6a2e9","cross_cats_sorted":["cs.CL","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-09T09:39:04Z","title_canon_sha256":"af3c760491377962869fe9a3c103424d3ae8a46b666e65546f2e26ca07abdf7f"},"schema_version":"1.0","source":{"id":"1505.02251","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02251","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02251v1","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02251","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"LZAAQ55FPLXO","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LZAAQ55FPLXOPINW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LZAAQ55F","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:6cb4c71e3f0dc62ddf622ee3c0cff78602519518708037abce07893d21339eec","target":"graph","created_at":"2026-05-18T02:16:19Z","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":"Hierarchies are frequently used for the organization of objects. Given a hierarchy of classes, two main approaches are used, to automatically classify new instances: flat classification and cascade classification. Flat classification ignores the hierarchy, while cascade classification greedily traverses the hierarchy from the root to the predicted leaf. In this paper we propose a new approach, which extends cascade classification to predict the right leaf by estimating the probability of each root-to-leaf path. We provide experimental results which indicate that, using the same classification ","authors_text":"Aris Kosmopoulos, Georgios Paliouras, Ion Androutsopoulos","cross_cats":["cs.CL","cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-09T09:39:04Z","title":"Probabilistic Cascading for Large Scale Hierarchical Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02251","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:ce9028d69c11cb9712cf4fdf4269cc1e10a10b9b037ecf122be83c72c8609a89","target":"record","created_at":"2026-05-18T02:16:19Z","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":"ea4d8dad03c524fcbc2d936e0ea6368025bb93a9572ba21f006ac9d685d6a2e9","cross_cats_sorted":["cs.CL","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-09T09:39:04Z","title_canon_sha256":"af3c760491377962869fe9a3c103424d3ae8a46b666e65546f2e26ca07abdf7f"},"schema_version":"1.0","source":{"id":"1505.02251","kind":"arxiv","version":1}},"canonical_sha256":"5e400877a57aeee7a1b659edb487d9c581d9966cd4635530d698f181f554df9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e400877a57aeee7a1b659edb487d9c581d9966cd4635530d698f181f554df9d","first_computed_at":"2026-05-18T02:16:19.445627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:19.445627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YKbZP5WT7n/p/vEg3PZxXxwNLXSe/xum9rCqKgnxsayj+k/F+jF7SJ3+nXmY7o6Z8WTXGelOCwDsGkwcGiWgAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:19.446116Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02251","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce9028d69c11cb9712cf4fdf4269cc1e10a10b9b037ecf122be83c72c8609a89","sha256:6cb4c71e3f0dc62ddf622ee3c0cff78602519518708037abce07893d21339eec"],"state_sha256":"8359e1e0c1f732a55793965ec496876d91da9d8438e4b3fd0ce566a9fc0138b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n7gYDma8H56+0FWo9j/90W5REIs7IHuEu2iARd4nBfjKSl4UKbhQrbX6ypHpHOZwz4VdLmRM0EAgbPaszGEYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T17:15:46.461378Z","bundle_sha256":"f4999c569b86ca468914c98746ea37b6869c345bc7e4914f81a03040d7285a3d"}}