{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AKMVZMKVJECM5CHYNDB7GPOCQQ","short_pith_number":"pith:AKMVZMKV","canonical_record":{"source":{"id":"1903.02999","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T15:52:45Z","cross_cats_sorted":[],"title_canon_sha256":"cb003bc0b170ebec8e0d6fd327186c9209cb786dfa19d848d2f045352b0c1025","abstract_canon_sha256":"f0ec8d5d3c35471260a9634ed1e88f529b99ca75caa8b29df6694ecb05899dc0"},"schema_version":"1.0"},"canonical_sha256":"02995cb1554904ce88f868c3f33dc28416fb9b1aae842d7648d2cef82e996700","source":{"kind":"arxiv","id":"1903.02999","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02999","created_at":"2026-05-17T23:47:57Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02999v2","created_at":"2026-05-17T23:47:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02999","created_at":"2026-05-17T23:47:57Z"},{"alias_kind":"pith_short_12","alias_value":"AKMVZMKVJECM","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AKMVZMKVJECM5CHY","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AKMVZMKV","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AKMVZMKVJECM5CHYNDB7GPOCQQ","target":"record","payload":{"canonical_record":{"source":{"id":"1903.02999","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T15:52:45Z","cross_cats_sorted":[],"title_canon_sha256":"cb003bc0b170ebec8e0d6fd327186c9209cb786dfa19d848d2f045352b0c1025","abstract_canon_sha256":"f0ec8d5d3c35471260a9634ed1e88f529b99ca75caa8b29df6694ecb05899dc0"},"schema_version":"1.0"},"canonical_sha256":"02995cb1554904ce88f868c3f33dc28416fb9b1aae842d7648d2cef82e996700","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:57.810765Z","signature_b64":"MnlH2rQALVypiMS4VN229hgmXo7eOc2WKTGaDmJHgUs4hZdekfVqaLfwv/NeoKojdKBHg98+ICCI47ZMoA+CCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02995cb1554904ce88f868c3f33dc28416fb9b1aae842d7648d2cef82e996700","last_reissued_at":"2026-05-17T23:47:57.810260Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:57.810260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.02999","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:47:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AnCB2IEB6W/LqDLnkLSBJHObSDzklTtcGczHKcXdgiwxnuNMcQHSfP6hjRW36QsRz+DkUvo4iRbKC0xr06sxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:03:21.927865Z"},"content_sha256":"b3dbcc4d4b491124cdd2e22fe7475e1bd650f898fe4cec5ec6434e09563ad81b","schema_version":"1.0","event_id":"sha256:b3dbcc4d4b491124cdd2e22fe7475e1bd650f898fe4cec5ec6434e09563ad81b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AKMVZMKVJECM5CHYNDB7GPOCQQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nikolaj Tatti","submitted_at":"2019-02-05T15:52:45Z","abstract_excerpt":"Interactions in many real-world phenomena can be explained by a strong hierarchical structure. Typically, this structure or ranking is not known; instead we only have observed outcomes of the interactions, and the goal is to infer the hierarchy from these observations. Discovering a hierarchy in the context of directed networks can be formulated as follows: given a graph, partition vertices into levels such that, ideally, there are only edges from upper levels to lower levels. The ideal case can only happen if the graph is acyclic. Consequently, in practice we have to introduce a penalty funct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02999","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:47:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ceblhmhOr5a4Zb6CfMfPhZgGKs5pdKumV9kDnwsBjHaUwNNiCV0I5dWjkSAO4FTEt+Exj+PQaihTOmgj9HOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:03:21.928292Z"},"content_sha256":"78676cf1a36f9fb4594c60e0b070b7b4fbac195ba05f92693793f46684338e0b","schema_version":"1.0","event_id":"sha256:78676cf1a36f9fb4594c60e0b070b7b4fbac195ba05f92693793f46684338e0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKMVZMKVJECM5CHYNDB7GPOCQQ/bundle.json","state_url":"https://pith.science/pith/AKMVZMKVJECM5CHYNDB7GPOCQQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKMVZMKVJECM5CHYNDB7GPOCQQ/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-26T23:03:21Z","links":{"resolver":"https://pith.science/pith/AKMVZMKVJECM5CHYNDB7GPOCQQ","bundle":"https://pith.science/pith/AKMVZMKVJECM5CHYNDB7GPOCQQ/bundle.json","state":"https://pith.science/pith/AKMVZMKVJECM5CHYNDB7GPOCQQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKMVZMKVJECM5CHYNDB7GPOCQQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AKMVZMKVJECM5CHYNDB7GPOCQQ","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":"f0ec8d5d3c35471260a9634ed1e88f529b99ca75caa8b29df6694ecb05899dc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T15:52:45Z","title_canon_sha256":"cb003bc0b170ebec8e0d6fd327186c9209cb786dfa19d848d2f045352b0c1025"},"schema_version":"1.0","source":{"id":"1903.02999","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02999","created_at":"2026-05-17T23:47:57Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02999v2","created_at":"2026-05-17T23:47:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02999","created_at":"2026-05-17T23:47:57Z"},{"alias_kind":"pith_short_12","alias_value":"AKMVZMKVJECM","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AKMVZMKVJECM5CHY","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AKMVZMKV","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:78676cf1a36f9fb4594c60e0b070b7b4fbac195ba05f92693793f46684338e0b","target":"graph","created_at":"2026-05-17T23:47: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":"Interactions in many real-world phenomena can be explained by a strong hierarchical structure. Typically, this structure or ranking is not known; instead we only have observed outcomes of the interactions, and the goal is to infer the hierarchy from these observations. Discovering a hierarchy in the context of directed networks can be formulated as follows: given a graph, partition vertices into levels such that, ideally, there are only edges from upper levels to lower levels. The ideal case can only happen if the graph is acyclic. Consequently, in practice we have to introduce a penalty funct","authors_text":"Nikolaj Tatti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T15:52:45Z","title":"Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02999","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:b3dbcc4d4b491124cdd2e22fe7475e1bd650f898fe4cec5ec6434e09563ad81b","target":"record","created_at":"2026-05-17T23:47: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":"f0ec8d5d3c35471260a9634ed1e88f529b99ca75caa8b29df6694ecb05899dc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T15:52:45Z","title_canon_sha256":"cb003bc0b170ebec8e0d6fd327186c9209cb786dfa19d848d2f045352b0c1025"},"schema_version":"1.0","source":{"id":"1903.02999","kind":"arxiv","version":2}},"canonical_sha256":"02995cb1554904ce88f868c3f33dc28416fb9b1aae842d7648d2cef82e996700","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02995cb1554904ce88f868c3f33dc28416fb9b1aae842d7648d2cef82e996700","first_computed_at":"2026-05-17T23:47:57.810260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:57.810260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MnlH2rQALVypiMS4VN229hgmXo7eOc2WKTGaDmJHgUs4hZdekfVqaLfwv/NeoKojdKBHg98+ICCI47ZMoA+CCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:57.810765Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02999","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3dbcc4d4b491124cdd2e22fe7475e1bd650f898fe4cec5ec6434e09563ad81b","sha256:78676cf1a36f9fb4594c60e0b070b7b4fbac195ba05f92693793f46684338e0b"],"state_sha256":"2a6665645393a764c40e7b9d48c7f17b9b89b5943a23091884df29d7750428e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"555yGlmOg2gt4lFTMzJStHeYAsIVkiJkLB8wABX3tJhsogsnPYRTretcYAdXKL/G/SJjZSRSr/sONHYCKRIaBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:03:21.930766Z","bundle_sha256":"98bb3c85b08892adaca70f2fafe954f1570f0335bdb1e8020fd5b2cb841763e1"}}