{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DIS7SI7VG7ETVVM3OKRLUL7PQ3","short_pith_number":"pith:DIS7SI7V","canonical_record":{"source":{"id":"1901.07335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-22T14:38:15Z","cross_cats_sorted":[],"title_canon_sha256":"31b16b2d60831c9e478e1cb0fef6389b2d2bb533ebc7b26fec9339d4ec7af250","abstract_canon_sha256":"a5df5fe2a8ed1de3dd10cd27fffe2110eb63f6cd023c833bd35271d61b046e29"},"schema_version":"1.0"},"canonical_sha256":"1a25f923f537c93ad59b72a2ba2fef86fa33b1d3a426141b57f277dbb321d22b","source":{"kind":"arxiv","id":"1901.07335","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07335","created_at":"2026-05-17T23:51:30Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07335v2","created_at":"2026-05-17T23:51:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07335","created_at":"2026-05-17T23:51:30Z"},{"alias_kind":"pith_short_12","alias_value":"DIS7SI7VG7ET","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DIS7SI7VG7ETVVM3","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DIS7SI7V","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DIS7SI7VG7ETVVM3OKRLUL7PQ3","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-22T14:38:15Z","cross_cats_sorted":[],"title_canon_sha256":"31b16b2d60831c9e478e1cb0fef6389b2d2bb533ebc7b26fec9339d4ec7af250","abstract_canon_sha256":"a5df5fe2a8ed1de3dd10cd27fffe2110eb63f6cd023c833bd35271d61b046e29"},"schema_version":"1.0"},"canonical_sha256":"1a25f923f537c93ad59b72a2ba2fef86fa33b1d3a426141b57f277dbb321d22b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:30.239962Z","signature_b64":"JDOKIMpn4ieFlW3cHFY3wJH2V3OTHG0GcAuhED7Ad78DFbUNyS7YyCjZRdwsVZu605sHpcad5vfXlQ1FyE2SAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a25f923f537c93ad59b72a2ba2fef86fa33b1d3a426141b57f277dbb321d22b","last_reissued_at":"2026-05-17T23:51:30.239572Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:30.239572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07335","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-17T23:51:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4O0glmJQ7yWb6FT7ENYEtLwiNeEj0QEaxknN0UGskK95nFrKpzNAtleRnL6DO04aERyTRpo5UCE6wdUix4WxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T10:39:48.197377Z"},"content_sha256":"8fbed0759be5bf4579c0efbc64c0a291519641ab3c6a1ad8a7ff1398a1954b9a","schema_version":"1.0","event_id":"sha256:8fbed0759be5bf4579c0efbc64c0a291519641ab3c6a1ad8a7ff1398a1954b9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DIS7SI7VG7ETVVM3OKRLUL7PQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adapting The Secretary Hiring Problem for Optimal Hot-Cold Tier Placement under Top-$K$ Workloads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andreas Hellander, Ben Blamey, Fredrik Wrede, Johan Karlsson, Salman Toor","submitted_at":"2019-01-22T14:38:15Z","abstract_excerpt":"Top-K queries are an established heuristic in information retrieval. This paper presents an approach for optimal tiered storage allocation under stream processing workloads using this heuristic: those requiring the analysis of only the top-$K$ ranked most relevant, or most interesting, documents from a fixed-length stream, stream window, or batch job. In this workflow, documents are analyzed relevance with a user-specified interestingness function, on which they are ranked, the top-$K$ being selected (and hence stored) for further processing. This workflow allows human in the loop systems, inc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07335","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-17T23:51:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cwp02Et1T/WO8tpj6H8PQ88ym10TzFlW22LFRgBnZUGAJMUa5PXQdujlsufTKB1Hh3NkbFRmj84ZKEPSbS0iDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T10:39:48.197880Z"},"content_sha256":"10338681ca835d0721eaad6bf8ac0aca5866e8d196052589d787938aa44309a9","schema_version":"1.0","event_id":"sha256:10338681ca835d0721eaad6bf8ac0aca5866e8d196052589d787938aa44309a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DIS7SI7VG7ETVVM3OKRLUL7PQ3/bundle.json","state_url":"https://pith.science/pith/DIS7SI7VG7ETVVM3OKRLUL7PQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DIS7SI7VG7ETVVM3OKRLUL7PQ3/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-19T10:39:48Z","links":{"resolver":"https://pith.science/pith/DIS7SI7VG7ETVVM3OKRLUL7PQ3","bundle":"https://pith.science/pith/DIS7SI7VG7ETVVM3OKRLUL7PQ3/bundle.json","state":"https://pith.science/pith/DIS7SI7VG7ETVVM3OKRLUL7PQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DIS7SI7VG7ETVVM3OKRLUL7PQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DIS7SI7VG7ETVVM3OKRLUL7PQ3","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":"a5df5fe2a8ed1de3dd10cd27fffe2110eb63f6cd023c833bd35271d61b046e29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-22T14:38:15Z","title_canon_sha256":"31b16b2d60831c9e478e1cb0fef6389b2d2bb533ebc7b26fec9339d4ec7af250"},"schema_version":"1.0","source":{"id":"1901.07335","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07335","created_at":"2026-05-17T23:51:30Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07335v2","created_at":"2026-05-17T23:51:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07335","created_at":"2026-05-17T23:51:30Z"},{"alias_kind":"pith_short_12","alias_value":"DIS7SI7VG7ET","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DIS7SI7VG7ETVVM3","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DIS7SI7V","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:10338681ca835d0721eaad6bf8ac0aca5866e8d196052589d787938aa44309a9","target":"graph","created_at":"2026-05-17T23:51:30Z","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":"Top-K queries are an established heuristic in information retrieval. This paper presents an approach for optimal tiered storage allocation under stream processing workloads using this heuristic: those requiring the analysis of only the top-$K$ ranked most relevant, or most interesting, documents from a fixed-length stream, stream window, or batch job. In this workflow, documents are analyzed relevance with a user-specified interestingness function, on which they are ranked, the top-$K$ being selected (and hence stored) for further processing. This workflow allows human in the loop systems, inc","authors_text":"Andreas Hellander, Ben Blamey, Fredrik Wrede, Johan Karlsson, Salman Toor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-22T14:38:15Z","title":"Adapting The Secretary Hiring Problem for Optimal Hot-Cold Tier Placement under Top-$K$ Workloads"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07335","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:8fbed0759be5bf4579c0efbc64c0a291519641ab3c6a1ad8a7ff1398a1954b9a","target":"record","created_at":"2026-05-17T23:51:30Z","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":"a5df5fe2a8ed1de3dd10cd27fffe2110eb63f6cd023c833bd35271d61b046e29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-22T14:38:15Z","title_canon_sha256":"31b16b2d60831c9e478e1cb0fef6389b2d2bb533ebc7b26fec9339d4ec7af250"},"schema_version":"1.0","source":{"id":"1901.07335","kind":"arxiv","version":2}},"canonical_sha256":"1a25f923f537c93ad59b72a2ba2fef86fa33b1d3a426141b57f277dbb321d22b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a25f923f537c93ad59b72a2ba2fef86fa33b1d3a426141b57f277dbb321d22b","first_computed_at":"2026-05-17T23:51:30.239572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:30.239572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JDOKIMpn4ieFlW3cHFY3wJH2V3OTHG0GcAuhED7Ad78DFbUNyS7YyCjZRdwsVZu605sHpcad5vfXlQ1FyE2SAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:30.239962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07335","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fbed0759be5bf4579c0efbc64c0a291519641ab3c6a1ad8a7ff1398a1954b9a","sha256:10338681ca835d0721eaad6bf8ac0aca5866e8d196052589d787938aa44309a9"],"state_sha256":"8c9ac92f587817bb0bb157e4da2901f783396b081577d6377cdbaf6f44aa99a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oZgYAd4qrQtbnDFp9Dsz/cN12hd5fXdHlfoNIUG8z60IWcpbrL/CGGU3Z8Hrr0XYS/LDXikHG/BvgO3hIGkhBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T10:39:48.199462Z","bundle_sha256":"c55ae163d6c47547d804b6cbd1557d8292c9796211879ca04972c7752f4c3765"}}