{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LE77AKZQ5BXPDMS24J4HVCYIO2","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":"79493d78a51a715ddb9b6dad05884aee3825ee7c1db55f588c8e48db8b7eeb52","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-04-09T12:43:33Z","title_canon_sha256":"4716a2149e58d382d901d012ab05a6e55a15a79f13d6d39202d2369c6d8fd06e"},"schema_version":"1.0","source":{"id":"1904.04626","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04626","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04626v1","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04626","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"pith_short_12","alias_value":"LE77AKZQ5BXP","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LE77AKZQ5BXPDMS2","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LE77AKZQ","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:1586b98d7a2524167c49ff1b7b2aa2ef0e2328161978fa7329100faa85c8fb81","target":"graph","created_at":"2026-05-17T23:48:58Z","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":"Hidden graphs are flexible abstractions that are composed of a set of known vertices (nodes), whereas the set of edges are not known in advance. To uncover the set of edges, multiple edge probing queries must be executed by evaluating a function $f(u,v)$ that returns either true or false, if nodes $u$ and $v$ are connected or not respectively. Evidently, the graph can be revealed completely if all possible $n(n-1)/2$ probes are executed for a graph containing $n$ nodes. However, the function $f()$ is usually computationally intensive and therefore executing all possible probing queries result ","authors_text":"Apostolos N. Papadopoulos, Panagiotis Kostoglou, Yannis Manolopoulos","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-04-09T12:43:33Z","title":"Distributed Computation of Top-$k$ Degrees in Hidden Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04626","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:0574c37343df208de28d11819a5e262b0003f9837c75016f0e978f946c96eab9","target":"record","created_at":"2026-05-17T23:48:58Z","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":"79493d78a51a715ddb9b6dad05884aee3825ee7c1db55f588c8e48db8b7eeb52","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-04-09T12:43:33Z","title_canon_sha256":"4716a2149e58d382d901d012ab05a6e55a15a79f13d6d39202d2369c6d8fd06e"},"schema_version":"1.0","source":{"id":"1904.04626","kind":"arxiv","version":1}},"canonical_sha256":"593ff02b30e86ef1b25ae2787a8b08769a30b8eb2a6e6675c53bef46e4373948","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"593ff02b30e86ef1b25ae2787a8b08769a30b8eb2a6e6675c53bef46e4373948","first_computed_at":"2026-05-17T23:48:58.562619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:58.562619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sb228Em6QsRzSzqzhMvejpNgn7S2AisAQ/l9E2xrvQmcTl7HhmHJeuBCwex80l2NWZPIAqA2cQTPc293RcTNDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:58.563030Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.04626","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0574c37343df208de28d11819a5e262b0003f9837c75016f0e978f946c96eab9","sha256:1586b98d7a2524167c49ff1b7b2aa2ef0e2328161978fa7329100faa85c8fb81"],"state_sha256":"95b8e66070eb7c74534c9a1b10160e8f06df29c65430e2310f28ab011e966f5c"}