{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4FU7G2BPJM6HMMITVSIQERDUGX","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":"81ca06603cf94456fcf354c1316b78bd8a6566a7fa5fa0b32c91ebe1d8e94107","cross_cats_sorted":["cs.CC","cs.DS","math.CO","math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-11-18T18:20:30Z","title_canon_sha256":"380a42dfbb965c715fdd6c78b5df87e2da43460ab014ac99c53a9acd618e443e"},"schema_version":"1.0","source":{"id":"2411.19885","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.19885","created_at":"2026-07-05T09:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"2411.19885v1","created_at":"2026-07-05T09:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.19885","created_at":"2026-07-05T09:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"4FU7G2BPJM6H","created_at":"2026-07-05T09:42:09Z"},{"alias_kind":"pith_short_16","alias_value":"4FU7G2BPJM6HMMIT","created_at":"2026-07-05T09:42:09Z"},{"alias_kind":"pith_short_8","alias_value":"4FU7G2BP","created_at":"2026-07-05T09:42:09Z"}],"graph_snapshots":[{"event_id":"sha256:606638004affbe4bcf1cc1055c74a271691a399fbc37c62125634674746f924d","target":"graph","created_at":"2026-07-05T09:42:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.19885/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of detecting or recovering a planted ranked subgraph from a directed graph, an analog for directed graphs of the well-studied planted dense subgraph model. We suppose that, among a set of $n$ items, there is a subset $S$ of $k$ items having a latent ranking in the form of a permutation $\\pi$ of $S$, and that we observe a fraction $p$ of pairwise orderings between elements of $\\{1, \\dots, n\\}$ which agree with $\\pi$ with probability $\\frac{1}{2} + q$ between elements of $S$ and otherwise are uniformly random. Unlike in the planted dense subgraph and planted clique problems ","authors_text":"Alexander S. Wein, Daniel A. Spielman, Dmitriy Kunisky, Xifan Yu","cross_cats":["cs.CC","cs.DS","math.CO","math.PR","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.19885","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:00ec5a0e6194493791d3a2b2aa9d818ac283fdfea7c567c32fef6500b1906439","target":"record","created_at":"2026-07-05T09:42:09Z","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":"81ca06603cf94456fcf354c1316b78bd8a6566a7fa5fa0b32c91ebe1d8e94107","cross_cats_sorted":["cs.CC","cs.DS","math.CO","math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-11-18T18:20:30Z","title_canon_sha256":"380a42dfbb965c715fdd6c78b5df87e2da43460ab014ac99c53a9acd618e443e"},"schema_version":"1.0","source":{"id":"2411.19885","kind":"arxiv","version":1}},"canonical_sha256":"e169f3682f4b3c763113ac9102447435d2e2dd5e49b3ecf3e84a1c1618d64014","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e169f3682f4b3c763113ac9102447435d2e2dd5e49b3ecf3e84a1c1618d64014","first_computed_at":"2026-07-05T09:42:09.786738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:42:09.786738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wtoqELdYhRIg0txbxVyPrjS7A3f6AXm2dYyhXHJ6tCguQY817CfkrnySmhkOsilsqdBxr5Wy5QKLPICElBnTBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:42:09.787244Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.19885","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00ec5a0e6194493791d3a2b2aa9d818ac283fdfea7c567c32fef6500b1906439","sha256:606638004affbe4bcf1cc1055c74a271691a399fbc37c62125634674746f924d"],"state_sha256":"6dd23f65ae1b3e2abba1853dfe3ec3e54799553c8342cf92d1f06fd8008f7d65"}