{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LE77AKZQ5BXPDMS24J4HVCYIO2","short_pith_number":"pith:LE77AKZQ","schema_version":"1.0","canonical_sha256":"593ff02b30e86ef1b25ae2787a8b08769a30b8eb2a6e6675c53bef46e4373948","source":{"kind":"arxiv","id":"1904.04626","version":1},"attestation_state":"computed","paper":{"title":"Distributed Computation of Top-$k$ Degrees in Hidden Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SI","authors_text":"Apostolos N. Papadopoulos, Panagiotis Kostoglou, Yannis Manolopoulos","submitted_at":"2019-04-09T12:43:33Z","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 "},"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":"1904.04626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-04-09T12:43:33Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"4716a2149e58d382d901d012ab05a6e55a15a79f13d6d39202d2369c6d8fd06e","abstract_canon_sha256":"79493d78a51a715ddb9b6dad05884aee3825ee7c1db55f588c8e48db8b7eeb52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:58.563030Z","signature_b64":"sb228Em6QsRzSzqzhMvejpNgn7S2AisAQ/l9E2xrvQmcTl7HhmHJeuBCwex80l2NWZPIAqA2cQTPc293RcTNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"593ff02b30e86ef1b25ae2787a8b08769a30b8eb2a6e6675c53bef46e4373948","last_reissued_at":"2026-05-17T23:48:58.562619Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:58.562619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Computation of Top-$k$ Degrees in Hidden Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SI","authors_text":"Apostolos N. Papadopoulos, Panagiotis Kostoglou, Yannis Manolopoulos","submitted_at":"2019-04-09T12:43:33Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04626","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":"1904.04626","created_at":"2026-05-17T23:48:58.562689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.04626v1","created_at":"2026-05-17T23:48:58.562689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04626","created_at":"2026-05-17T23:48:58.562689+00:00"},{"alias_kind":"pith_short_12","alias_value":"LE77AKZQ5BXP","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LE77AKZQ5BXPDMS2","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LE77AKZQ","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/LE77AKZQ5BXPDMS24J4HVCYIO2","json":"https://pith.science/pith/LE77AKZQ5BXPDMS24J4HVCYIO2.json","graph_json":"https://pith.science/api/pith-number/LE77AKZQ5BXPDMS24J4HVCYIO2/graph.json","events_json":"https://pith.science/api/pith-number/LE77AKZQ5BXPDMS24J4HVCYIO2/events.json","paper":"https://pith.science/paper/LE77AKZQ"},"agent_actions":{"view_html":"https://pith.science/pith/LE77AKZQ5BXPDMS24J4HVCYIO2","download_json":"https://pith.science/pith/LE77AKZQ5BXPDMS24J4HVCYIO2.json","view_paper":"https://pith.science/paper/LE77AKZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.04626&json=true","fetch_graph":"https://pith.science/api/pith-number/LE77AKZQ5BXPDMS24J4HVCYIO2/graph.json","fetch_events":"https://pith.science/api/pith-number/LE77AKZQ5BXPDMS24J4HVCYIO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LE77AKZQ5BXPDMS24J4HVCYIO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LE77AKZQ5BXPDMS24J4HVCYIO2/action/storage_attestation","attest_author":"https://pith.science/pith/LE77AKZQ5BXPDMS24J4HVCYIO2/action/author_attestation","sign_citation":"https://pith.science/pith/LE77AKZQ5BXPDMS24J4HVCYIO2/action/citation_signature","submit_replication":"https://pith.science/pith/LE77AKZQ5BXPDMS24J4HVCYIO2/action/replication_record"}},"created_at":"2026-05-17T23:48:58.562689+00:00","updated_at":"2026-05-17T23:48:58.562689+00:00"}