{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LOIMFJCRLO6AB6FVUPN56VWKUZ","short_pith_number":"pith:LOIMFJCR","canonical_record":{"source":{"id":"1902.01477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-04T22:12:16Z","cross_cats_sorted":[],"title_canon_sha256":"487cd4fbb70c4b7f5ea63a52f920d8c2ff41dc7b97a84fe35133b1d0aa0100c4","abstract_canon_sha256":"6183750c932ae4d53b4acd981a8f03ba6afc2b11fda465f15bd7a06717c2b7d2"},"schema_version":"1.0"},"canonical_sha256":"5b90c2a4515bbc00f8b5a3dbdf56caa6729482d2bc4178be0602dda799b69448","source":{"kind":"arxiv","id":"1902.01477","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01477","created_at":"2026-05-17T23:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01477v1","created_at":"2026-05-17T23:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01477","created_at":"2026-05-17T23:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"LOIMFJCRLO6A","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LOIMFJCRLO6AB6FV","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LOIMFJCR","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LOIMFJCRLO6AB6FVUPN56VWKUZ","target":"record","payload":{"canonical_record":{"source":{"id":"1902.01477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-04T22:12:16Z","cross_cats_sorted":[],"title_canon_sha256":"487cd4fbb70c4b7f5ea63a52f920d8c2ff41dc7b97a84fe35133b1d0aa0100c4","abstract_canon_sha256":"6183750c932ae4d53b4acd981a8f03ba6afc2b11fda465f15bd7a06717c2b7d2"},"schema_version":"1.0"},"canonical_sha256":"5b90c2a4515bbc00f8b5a3dbdf56caa6729482d2bc4178be0602dda799b69448","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:47.604705Z","signature_b64":"MKDmJ1gDtGwXeQDcxbtqavv+ZyFpjhafzYzbIu4itwF4N1W2uTCY28u2t2dWRpohqFrMSHQ4OG/8HG4/SOcvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b90c2a4515bbc00f8b5a3dbdf56caa6729482d2bc4178be0602dda799b69448","last_reissued_at":"2026-05-17T23:54:47.604134Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:47.604134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.01477","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:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C+KYiQyorpqkYzV9eUyMYf0MTf3iVoNQjzAlRxww3ZwtyiZefGaMNkhe5qIAMgmGKR0xgjTMCn+wePwJPsbyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:17:14.957193Z"},"content_sha256":"ee5783e1717ec7f5aeb3a910b8ec79e7e9b0f9f2ce5047fde8beda40cc3dd9bd","schema_version":"1.0","event_id":"sha256:ee5783e1717ec7f5aeb3a910b8ec79e7e9b0f9f2ce5047fde8beda40cc3dd9bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LOIMFJCRLO6AB6FVUPN56VWKUZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster way to agony: Discovering hierarchies in directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nikolaj Tatti","submitted_at":"2019-02-04T22:12:16Z","abstract_excerpt":"Many real-world phenomena exhibit strong hierarchical structure. Consequently, in many real-world directed social networks vertices do not play equal role. Instead, vertices form a hierarchy such that the edges appear mainly from upper levels to lower levels. Discovering hierarchies from such graphs is a challenging problem that has gained attention. Formally, given a directed graph, we want to partition vertices into levels such that ideally there are only edges from upper levels to lower levels. From computational point of view, the ideal case is when the underlying directed graph is acyclic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01477","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:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aFVt0RaMEewdmRvqfC/53mL74GYd7FqVcB+kpMUVdlMKs+KTMHghc9SdO8uT7/aokG9pyLIHCSgZbievRckCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:17:14.957744Z"},"content_sha256":"8736322e87d5d6dfdf8d6354d264462c864cee9b1079e1ea83ace1fb43f7f908","schema_version":"1.0","event_id":"sha256:8736322e87d5d6dfdf8d6354d264462c864cee9b1079e1ea83ace1fb43f7f908"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LOIMFJCRLO6AB6FVUPN56VWKUZ/bundle.json","state_url":"https://pith.science/pith/LOIMFJCRLO6AB6FVUPN56VWKUZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LOIMFJCRLO6AB6FVUPN56VWKUZ/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-26T21:17:14Z","links":{"resolver":"https://pith.science/pith/LOIMFJCRLO6AB6FVUPN56VWKUZ","bundle":"https://pith.science/pith/LOIMFJCRLO6AB6FVUPN56VWKUZ/bundle.json","state":"https://pith.science/pith/LOIMFJCRLO6AB6FVUPN56VWKUZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LOIMFJCRLO6AB6FVUPN56VWKUZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LOIMFJCRLO6AB6FVUPN56VWKUZ","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":"6183750c932ae4d53b4acd981a8f03ba6afc2b11fda465f15bd7a06717c2b7d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-04T22:12:16Z","title_canon_sha256":"487cd4fbb70c4b7f5ea63a52f920d8c2ff41dc7b97a84fe35133b1d0aa0100c4"},"schema_version":"1.0","source":{"id":"1902.01477","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01477","created_at":"2026-05-17T23:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01477v1","created_at":"2026-05-17T23:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01477","created_at":"2026-05-17T23:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"LOIMFJCRLO6A","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LOIMFJCRLO6AB6FV","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LOIMFJCR","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:8736322e87d5d6dfdf8d6354d264462c864cee9b1079e1ea83ace1fb43f7f908","target":"graph","created_at":"2026-05-17T23:54:47Z","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":"Many real-world phenomena exhibit strong hierarchical structure. Consequently, in many real-world directed social networks vertices do not play equal role. Instead, vertices form a hierarchy such that the edges appear mainly from upper levels to lower levels. Discovering hierarchies from such graphs is a challenging problem that has gained attention. Formally, given a directed graph, we want to partition vertices into levels such that ideally there are only edges from upper levels to lower levels. From computational point of view, the ideal case is when the underlying directed graph is acyclic","authors_text":"Nikolaj Tatti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-04T22:12:16Z","title":"Faster way to agony: Discovering hierarchies in directed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01477","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:ee5783e1717ec7f5aeb3a910b8ec79e7e9b0f9f2ce5047fde8beda40cc3dd9bd","target":"record","created_at":"2026-05-17T23:54:47Z","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":"6183750c932ae4d53b4acd981a8f03ba6afc2b11fda465f15bd7a06717c2b7d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-04T22:12:16Z","title_canon_sha256":"487cd4fbb70c4b7f5ea63a52f920d8c2ff41dc7b97a84fe35133b1d0aa0100c4"},"schema_version":"1.0","source":{"id":"1902.01477","kind":"arxiv","version":1}},"canonical_sha256":"5b90c2a4515bbc00f8b5a3dbdf56caa6729482d2bc4178be0602dda799b69448","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b90c2a4515bbc00f8b5a3dbdf56caa6729482d2bc4178be0602dda799b69448","first_computed_at":"2026-05-17T23:54:47.604134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:47.604134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MKDmJ1gDtGwXeQDcxbtqavv+ZyFpjhafzYzbIu4itwF4N1W2uTCY28u2t2dWRpohqFrMSHQ4OG/8HG4/SOcvBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:47.604705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01477","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee5783e1717ec7f5aeb3a910b8ec79e7e9b0f9f2ce5047fde8beda40cc3dd9bd","sha256:8736322e87d5d6dfdf8d6354d264462c864cee9b1079e1ea83ace1fb43f7f908"],"state_sha256":"e1934a5f05fdf0aa305c14affe0a74df8dc43b8f107c3e943a38644f2265bec2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RzQuO6OvOQ4Y2nlEhh1Psxm9Q2Dh7bU5beWvNa8DXL+LgP1QcnrDBtxK6pHcCMGQxOcPpYIwyoMzOFq86UNeBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:17:14.960358Z","bundle_sha256":"0981820cf85f0f4d647f7a1f0e130a6a1392769993d00266dfed00b0102f261a"}}