{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RCTJ5VQMKI7KSS77SJQ7PQHDGA","short_pith_number":"pith:RCTJ5VQM","schema_version":"1.0","canonical_sha256":"88a69ed60c523ea94bff9261f7c0e3300d2730c8095a8c7441c42b16a88606ab","source":{"kind":"arxiv","id":"1712.02827","version":1},"attestation_state":"computed","paper":{"title":"Core Discovery in Hidden Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Apostolos Papadopoulos, Panagiotis Strouthopoulos","submitted_at":"2017-12-07T19:32:06Z","abstract_excerpt":"Massive network exploration is an important research direction with many applications. In such a setting, the network is, usually, modeled as a graph $G$, whereas any structural information of interest is extracted by inspecting the way nodes are connected together. In the case where the adjacency matrix or the adjacency list of $G$ is available, one can directly apply graph mining algorithms to extract useful knowledge. However, there are cases where this is not possible because the graph is \\textit{hidden} or \\textit{implicit}, meaning that the edges are not recorded explicitly in the form o"},"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":"1712.02827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-07T19:32:06Z","cross_cats_sorted":[],"title_canon_sha256":"0e348a89295dd790edbe559129704572abff987399c8ea1d98a05c040398fc78","abstract_canon_sha256":"9ef8192b2cc56eb5ed2a1f7f2da60144408555c9a802ec9ab769f6ca72d00828"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:29.161213Z","signature_b64":"pg98+HeronCQ8+EoD4VrEHgnanWgR7o/IypUUNmzEvaEEKyZWfIpBCcN+m5NJp5rzi+nCWzr1sARMhVZTUYKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88a69ed60c523ea94bff9261f7c0e3300d2730c8095a8c7441c42b16a88606ab","last_reissued_at":"2026-05-18T00:28:29.160530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:29.160530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Core Discovery in Hidden Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Apostolos Papadopoulos, Panagiotis Strouthopoulos","submitted_at":"2017-12-07T19:32:06Z","abstract_excerpt":"Massive network exploration is an important research direction with many applications. In such a setting, the network is, usually, modeled as a graph $G$, whereas any structural information of interest is extracted by inspecting the way nodes are connected together. In the case where the adjacency matrix or the adjacency list of $G$ is available, one can directly apply graph mining algorithms to extract useful knowledge. However, there are cases where this is not possible because the graph is \\textit{hidden} or \\textit{implicit}, meaning that the edges are not recorded explicitly in the form o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02827","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":"1712.02827","created_at":"2026-05-18T00:28:29.160642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.02827v1","created_at":"2026-05-18T00:28:29.160642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02827","created_at":"2026-05-18T00:28:29.160642+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCTJ5VQMKI7K","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCTJ5VQMKI7KSS77","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCTJ5VQM","created_at":"2026-05-18T12:31:39.905425+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/RCTJ5VQMKI7KSS77SJQ7PQHDGA","json":"https://pith.science/pith/RCTJ5VQMKI7KSS77SJQ7PQHDGA.json","graph_json":"https://pith.science/api/pith-number/RCTJ5VQMKI7KSS77SJQ7PQHDGA/graph.json","events_json":"https://pith.science/api/pith-number/RCTJ5VQMKI7KSS77SJQ7PQHDGA/events.json","paper":"https://pith.science/paper/RCTJ5VQM"},"agent_actions":{"view_html":"https://pith.science/pith/RCTJ5VQMKI7KSS77SJQ7PQHDGA","download_json":"https://pith.science/pith/RCTJ5VQMKI7KSS77SJQ7PQHDGA.json","view_paper":"https://pith.science/paper/RCTJ5VQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.02827&json=true","fetch_graph":"https://pith.science/api/pith-number/RCTJ5VQMKI7KSS77SJQ7PQHDGA/graph.json","fetch_events":"https://pith.science/api/pith-number/RCTJ5VQMKI7KSS77SJQ7PQHDGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCTJ5VQMKI7KSS77SJQ7PQHDGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCTJ5VQMKI7KSS77SJQ7PQHDGA/action/storage_attestation","attest_author":"https://pith.science/pith/RCTJ5VQMKI7KSS77SJQ7PQHDGA/action/author_attestation","sign_citation":"https://pith.science/pith/RCTJ5VQMKI7KSS77SJQ7PQHDGA/action/citation_signature","submit_replication":"https://pith.science/pith/RCTJ5VQMKI7KSS77SJQ7PQHDGA/action/replication_record"}},"created_at":"2026-05-18T00:28:29.160642+00:00","updated_at":"2026-05-18T00:28:29.160642+00:00"}