{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZDGW3QN3EFPOJEDQWJDT4GGTBC","short_pith_number":"pith:ZDGW3QN3","canonical_record":{"source":{"id":"1902.01873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T19:12:09Z","cross_cats_sorted":[],"title_canon_sha256":"c74a847db054b73ce3a67a7d9bf102218932b148b8b26eb9ab94938fa84fbc33","abstract_canon_sha256":"3a74f54952fc7c67fe5f9aa5e191c954adb9047bcbdfc7b61cd04582614e64b8"},"schema_version":"1.0"},"canonical_sha256":"c8cd6dc1bb215ee49070b2473e18d308b40a410baf2dbc260c17bbfd81ec327c","source":{"kind":"arxiv","id":"1902.01873","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01873","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01873v1","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01873","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZDGW3QN3EFPO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZDGW3QN3EFPOJEDQ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZDGW3QN3","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZDGW3QN3EFPOJEDQWJDT4GGTBC","target":"record","payload":{"canonical_record":{"source":{"id":"1902.01873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T19:12:09Z","cross_cats_sorted":[],"title_canon_sha256":"c74a847db054b73ce3a67a7d9bf102218932b148b8b26eb9ab94938fa84fbc33","abstract_canon_sha256":"3a74f54952fc7c67fe5f9aa5e191c954adb9047bcbdfc7b61cd04582614e64b8"},"schema_version":"1.0"},"canonical_sha256":"c8cd6dc1bb215ee49070b2473e18d308b40a410baf2dbc260c17bbfd81ec327c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:38.567673Z","signature_b64":"NE1GI/RXtelRSUsh/X8523prp4RFp6WxV+HDV/kG1lSDSMNtM0D0FiLb6rJnt0dpBCqTHENc+zRwCpf2J72yCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8cd6dc1bb215ee49070b2473e18d308b40a410baf2dbc260c17bbfd81ec327c","last_reissued_at":"2026-05-17T23:54:38.567111Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:38.567111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.01873","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-17T23:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UWXbXSKU/r2yz+lAS7otLjrC/A+F1HaraY+7wgWi5iefHLn/f0yatfxyJyqvQAorkiBj9LNF5aGIdFhm0EjqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:36:24.337535Z"},"content_sha256":"508abe2ee342221dfa596609572af9a4bb89e514d321c56697b702c64c9516df","schema_version":"1.0","event_id":"sha256:508abe2ee342221dfa596609572af9a4bb89e514d321c56697b702c64c9516df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZDGW3QN3EFPOJEDQWJDT4GGTBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic hierarchies in temporal directed 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-05T19:12:09Z","abstract_excerpt":"The outcome of interactions in many real-world systems can be often explained by a hierarchy between the participants. Discovering hierarchy from a given directed network can be formulated as follows: partition vertices into levels such that, ideally, there are only forward edges, that is, edges from upper levels to lower levels. In practice, the ideal case is impossible, so instead we minimize some penalty function on the backward edges. One practical option for such a penalty is agony, where the penalty depends on the severity of the violation. In this paper we extend the definition of agony"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01873","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-17T23:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z1UMCoYw3oDiNHf2u7eiKTzrrOyb+5swaLS3VZ3oZCw6pMgdmTYtKZe3TnhMQALnksl1Xj1KNTqAqEpB5//ZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:36:24.337889Z"},"content_sha256":"bb6592f2cc95fce3a7233d7f7b393cd3b16d193968086f75b710c6112a1af302","schema_version":"1.0","event_id":"sha256:bb6592f2cc95fce3a7233d7f7b393cd3b16d193968086f75b710c6112a1af302"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZDGW3QN3EFPOJEDQWJDT4GGTBC/bundle.json","state_url":"https://pith.science/pith/ZDGW3QN3EFPOJEDQWJDT4GGTBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZDGW3QN3EFPOJEDQWJDT4GGTBC/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-01T03:36:24Z","links":{"resolver":"https://pith.science/pith/ZDGW3QN3EFPOJEDQWJDT4GGTBC","bundle":"https://pith.science/pith/ZDGW3QN3EFPOJEDQWJDT4GGTBC/bundle.json","state":"https://pith.science/pith/ZDGW3QN3EFPOJEDQWJDT4GGTBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZDGW3QN3EFPOJEDQWJDT4GGTBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZDGW3QN3EFPOJEDQWJDT4GGTBC","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":"3a74f54952fc7c67fe5f9aa5e191c954adb9047bcbdfc7b61cd04582614e64b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T19:12:09Z","title_canon_sha256":"c74a847db054b73ce3a67a7d9bf102218932b148b8b26eb9ab94938fa84fbc33"},"schema_version":"1.0","source":{"id":"1902.01873","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01873","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01873v1","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01873","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZDGW3QN3EFPO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZDGW3QN3EFPOJEDQ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZDGW3QN3","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:bb6592f2cc95fce3a7233d7f7b393cd3b16d193968086f75b710c6112a1af302","target":"graph","created_at":"2026-05-17T23:54:38Z","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":"The outcome of interactions in many real-world systems can be often explained by a hierarchy between the participants. Discovering hierarchy from a given directed network can be formulated as follows: partition vertices into levels such that, ideally, there are only forward edges, that is, edges from upper levels to lower levels. In practice, the ideal case is impossible, so instead we minimize some penalty function on the backward edges. One practical option for such a penalty is agony, where the penalty depends on the severity of the violation. In this paper we extend the definition of agony","authors_text":"Nikolaj Tatti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T19:12:09Z","title":"Dynamic hierarchies in temporal directed networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01873","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:508abe2ee342221dfa596609572af9a4bb89e514d321c56697b702c64c9516df","target":"record","created_at":"2026-05-17T23:54:38Z","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":"3a74f54952fc7c67fe5f9aa5e191c954adb9047bcbdfc7b61cd04582614e64b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T19:12:09Z","title_canon_sha256":"c74a847db054b73ce3a67a7d9bf102218932b148b8b26eb9ab94938fa84fbc33"},"schema_version":"1.0","source":{"id":"1902.01873","kind":"arxiv","version":1}},"canonical_sha256":"c8cd6dc1bb215ee49070b2473e18d308b40a410baf2dbc260c17bbfd81ec327c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8cd6dc1bb215ee49070b2473e18d308b40a410baf2dbc260c17bbfd81ec327c","first_computed_at":"2026-05-17T23:54:38.567111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:38.567111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NE1GI/RXtelRSUsh/X8523prp4RFp6WxV+HDV/kG1lSDSMNtM0D0FiLb6rJnt0dpBCqTHENc+zRwCpf2J72yCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:38.567673Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01873","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:508abe2ee342221dfa596609572af9a4bb89e514d321c56697b702c64c9516df","sha256:bb6592f2cc95fce3a7233d7f7b393cd3b16d193968086f75b710c6112a1af302"],"state_sha256":"74baa1878cfa74f455511017d007bbc857ab18de23551f0acef8dd8a258803d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jGjL5mP5nR5nWD+xonUieQfF1873Bf1DWesUyeI0BFiU7JC0Y/HxPeaFeQp07p0m7jnHHX9Se1ONVHth99DPAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:36:24.339898Z","bundle_sha256":"a92435524ea05d4d64c97420241f668f3f533947b0db63492e6acd18f9257e68"}}