{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LOIMFJCRLO6AB6FVUPN56VWKUZ","short_pith_number":"pith:LOIMFJCR","schema_version":"1.0","canonical_sha256":"5b90c2a4515bbc00f8b5a3dbdf56caa6729482d2bc4178be0602dda799b69448","source":{"kind":"arxiv","id":"1902.01477","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.01477","created_at":"2026-05-17T23:54:47.604226+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01477v1","created_at":"2026-05-17T23:54:47.604226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01477","created_at":"2026-05-17T23:54:47.604226+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOIMFJCRLO6A","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOIMFJCRLO6AB6FV","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOIMFJCR","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LOIMFJCRLO6AB6FVUPN56VWKUZ","json":"https://pith.science/pith/LOIMFJCRLO6AB6FVUPN56VWKUZ.json","graph_json":"https://pith.science/api/pith-number/LOIMFJCRLO6AB6FVUPN56VWKUZ/graph.json","events_json":"https://pith.science/api/pith-number/LOIMFJCRLO6AB6FVUPN56VWKUZ/events.json","paper":"https://pith.science/paper/LOIMFJCR"},"agent_actions":{"view_html":"https://pith.science/pith/LOIMFJCRLO6AB6FVUPN56VWKUZ","download_json":"https://pith.science/pith/LOIMFJCRLO6AB6FVUPN56VWKUZ.json","view_paper":"https://pith.science/paper/LOIMFJCR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01477&json=true","fetch_graph":"https://pith.science/api/pith-number/LOIMFJCRLO6AB6FVUPN56VWKUZ/graph.json","fetch_events":"https://pith.science/api/pith-number/LOIMFJCRLO6AB6FVUPN56VWKUZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOIMFJCRLO6AB6FVUPN56VWKUZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOIMFJCRLO6AB6FVUPN56VWKUZ/action/storage_attestation","attest_author":"https://pith.science/pith/LOIMFJCRLO6AB6FVUPN56VWKUZ/action/author_attestation","sign_citation":"https://pith.science/pith/LOIMFJCRLO6AB6FVUPN56VWKUZ/action/citation_signature","submit_replication":"https://pith.science/pith/LOIMFJCRLO6AB6FVUPN56VWKUZ/action/replication_record"}},"created_at":"2026-05-17T23:54:47.604226+00:00","updated_at":"2026-05-17T23:54:47.604226+00:00"}