{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RCTJ5VQMKI7KSS77SJQ7PQHDGA","short_pith_number":"pith:RCTJ5VQM","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"},"canonical_sha256":"88a69ed60c523ea94bff9261f7c0e3300d2730c8095a8c7441c42b16a88606ab","source":{"kind":"arxiv","id":"1712.02827","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02827","created_at":"2026-05-18T00:28:29Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02827v1","created_at":"2026-05-18T00:28:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02827","created_at":"2026-05-18T00:28:29Z"},{"alias_kind":"pith_short_12","alias_value":"RCTJ5VQMKI7K","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RCTJ5VQMKI7KSS77","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RCTJ5VQM","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RCTJ5VQMKI7KSS77SJQ7PQHDGA","target":"record","payload":{"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"},"canonical_sha256":"88a69ed60c523ea94bff9261f7c0e3300d2730c8095a8c7441c42b16a88606ab","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"},"source_kind":"arxiv","source_id":"1712.02827","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6JbtqmldIP8+ElCcNPkDX6soxeykzwrVZsmkwrBD102N+4O9ThG0kb58tTHe92lZ8gmB0D18Q58nYJjggr64Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:26:23.514903Z"},"content_sha256":"af8e1a2d3a9859bfe76e866031526a83ac74d24ca1e6f5eb32b1c403c7b4b32a","schema_version":"1.0","event_id":"sha256:af8e1a2d3a9859bfe76e866031526a83ac74d24ca1e6f5eb32b1c403c7b4b32a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RCTJ5VQMKI7KSS77SJQ7PQHDGA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gqxp9X8CnF4H/KWNxQCY/ck20JgVx55MRoP5ISvbFUNvkAvafRh/tmCmkCH8F+fLxYcd3YZVZ2/HpRoGo1LGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:26:23.515265Z"},"content_sha256":"8b757fc64356f3af3ace6b227ef3bf7fda11b96c1dd660fe8b0ed604f8d3e39f","schema_version":"1.0","event_id":"sha256:8b757fc64356f3af3ace6b227ef3bf7fda11b96c1dd660fe8b0ed604f8d3e39f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCTJ5VQMKI7KSS77SJQ7PQHDGA/bundle.json","state_url":"https://pith.science/pith/RCTJ5VQMKI7KSS77SJQ7PQHDGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCTJ5VQMKI7KSS77SJQ7PQHDGA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T08:26:23Z","links":{"resolver":"https://pith.science/pith/RCTJ5VQMKI7KSS77SJQ7PQHDGA","bundle":"https://pith.science/pith/RCTJ5VQMKI7KSS77SJQ7PQHDGA/bundle.json","state":"https://pith.science/pith/RCTJ5VQMKI7KSS77SJQ7PQHDGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCTJ5VQMKI7KSS77SJQ7PQHDGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RCTJ5VQMKI7KSS77SJQ7PQHDGA","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":"9ef8192b2cc56eb5ed2a1f7f2da60144408555c9a802ec9ab769f6ca72d00828","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-07T19:32:06Z","title_canon_sha256":"0e348a89295dd790edbe559129704572abff987399c8ea1d98a05c040398fc78"},"schema_version":"1.0","source":{"id":"1712.02827","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02827","created_at":"2026-05-18T00:28:29Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02827v1","created_at":"2026-05-18T00:28:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02827","created_at":"2026-05-18T00:28:29Z"},{"alias_kind":"pith_short_12","alias_value":"RCTJ5VQMKI7K","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RCTJ5VQMKI7KSS77","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RCTJ5VQM","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:8b757fc64356f3af3ace6b227ef3bf7fda11b96c1dd660fe8b0ed604f8d3e39f","target":"graph","created_at":"2026-05-18T00:28:29Z","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":"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","authors_text":"Apostolos Papadopoulos, Panagiotis Strouthopoulos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-07T19:32:06Z","title":"Core Discovery in Hidden Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02827","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:af8e1a2d3a9859bfe76e866031526a83ac74d24ca1e6f5eb32b1c403c7b4b32a","target":"record","created_at":"2026-05-18T00:28:29Z","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":"9ef8192b2cc56eb5ed2a1f7f2da60144408555c9a802ec9ab769f6ca72d00828","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-07T19:32:06Z","title_canon_sha256":"0e348a89295dd790edbe559129704572abff987399c8ea1d98a05c040398fc78"},"schema_version":"1.0","source":{"id":"1712.02827","kind":"arxiv","version":1}},"canonical_sha256":"88a69ed60c523ea94bff9261f7c0e3300d2730c8095a8c7441c42b16a88606ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88a69ed60c523ea94bff9261f7c0e3300d2730c8095a8c7441c42b16a88606ab","first_computed_at":"2026-05-18T00:28:29.160530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:29.160530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pg98+HeronCQ8+EoD4VrEHgnanWgR7o/IypUUNmzEvaEEKyZWfIpBCcN+m5NJp5rzi+nCWzr1sARMhVZTUYKCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:29.161213Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.02827","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af8e1a2d3a9859bfe76e866031526a83ac74d24ca1e6f5eb32b1c403c7b4b32a","sha256:8b757fc64356f3af3ace6b227ef3bf7fda11b96c1dd660fe8b0ed604f8d3e39f"],"state_sha256":"b80b2950a571344c2bc4263cd0cfaa4ed7b75f9dcf869c023340e61641a62c1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dEwH7k/uzXHJGpgPTgNvruVZpbXJhpMyyQB8FVNcl9LkrQ9POq0BOTlohPeUearKzS09cmD3wkDNHhS1rLsQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:26:23.517139Z","bundle_sha256":"33ed01a6160350c40897ea36f0c7065a1aef6b08d3508143ab8a5e8057353b89"}}