{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AXLQSRTZ3CO6B4775HNBFUUX6U","short_pith_number":"pith:AXLQSRTZ","schema_version":"1.0","canonical_sha256":"05d7094679d89de0f3ffe9da12d297f536c2bb43b426ff290a2d235dde2ed80a","source":{"kind":"arxiv","id":"1406.3411","version":1},"attestation_state":"computed","paper":{"title":"VoG: Summarizing and Understanding Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Christos Faloutsos, Danai Koutra, Jilles Vreeken, U Kang","submitted_at":"2014-06-13T03:19:42Z","abstract_excerpt":"How can we succinctly describe a million-node graph with a few simple sentences? How can we measure the \"importance\" of a set of discovered subgraphs in a large graph? These are exactly the problems we focus on. Our main ideas are to construct a \"vocabulary\" of subgraph-types that often occur in real graphs (e.g., stars, cliques, chains), and from a set of subgraphs, find the most succinct description of a graph in terms of this vocabulary. We measure success in a well-founded way by means of the Minimum Description Length (MDL) principle: a subgraph is included in the summary if it decreases "},"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":"1406.3411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-06-13T03:19:42Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"d89f22c460face04141bc1e2e02bd2ec7d7f168e14ce4b7d54d838669fbf1403","abstract_canon_sha256":"48c949b20323c19c8c6cd82d551b1db57e5244fdb3ac95cffc9c1cb71a5bb273"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:46.744168Z","signature_b64":"Uwh8Xo7ANSyB//Mkp5ISFaH0zrcmB6aDxayrmp9Zwn/7Bo+kOzu2bjlw1i1S+A8dtLZyDixSF0FSA18JxP4zCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05d7094679d89de0f3ffe9da12d297f536c2bb43b426ff290a2d235dde2ed80a","last_reissued_at":"2026-05-18T02:49:46.743666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:46.743666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VoG: Summarizing and Understanding Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Christos Faloutsos, Danai Koutra, Jilles Vreeken, U Kang","submitted_at":"2014-06-13T03:19:42Z","abstract_excerpt":"How can we succinctly describe a million-node graph with a few simple sentences? How can we measure the \"importance\" of a set of discovered subgraphs in a large graph? These are exactly the problems we focus on. Our main ideas are to construct a \"vocabulary\" of subgraph-types that often occur in real graphs (e.g., stars, cliques, chains), and from a set of subgraphs, find the most succinct description of a graph in terms of this vocabulary. We measure success in a well-founded way by means of the Minimum Description Length (MDL) principle: a subgraph is included in the summary if it decreases "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3411","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":"1406.3411","created_at":"2026-05-18T02:49:46.743744+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3411v1","created_at":"2026-05-18T02:49:46.743744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3411","created_at":"2026-05-18T02:49:46.743744+00:00"},{"alias_kind":"pith_short_12","alias_value":"AXLQSRTZ3CO6","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AXLQSRTZ3CO6B477","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AXLQSRTZ","created_at":"2026-05-18T12:28:19.803747+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/AXLQSRTZ3CO6B4775HNBFUUX6U","json":"https://pith.science/pith/AXLQSRTZ3CO6B4775HNBFUUX6U.json","graph_json":"https://pith.science/api/pith-number/AXLQSRTZ3CO6B4775HNBFUUX6U/graph.json","events_json":"https://pith.science/api/pith-number/AXLQSRTZ3CO6B4775HNBFUUX6U/events.json","paper":"https://pith.science/paper/AXLQSRTZ"},"agent_actions":{"view_html":"https://pith.science/pith/AXLQSRTZ3CO6B4775HNBFUUX6U","download_json":"https://pith.science/pith/AXLQSRTZ3CO6B4775HNBFUUX6U.json","view_paper":"https://pith.science/paper/AXLQSRTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3411&json=true","fetch_graph":"https://pith.science/api/pith-number/AXLQSRTZ3CO6B4775HNBFUUX6U/graph.json","fetch_events":"https://pith.science/api/pith-number/AXLQSRTZ3CO6B4775HNBFUUX6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AXLQSRTZ3CO6B4775HNBFUUX6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AXLQSRTZ3CO6B4775HNBFUUX6U/action/storage_attestation","attest_author":"https://pith.science/pith/AXLQSRTZ3CO6B4775HNBFUUX6U/action/author_attestation","sign_citation":"https://pith.science/pith/AXLQSRTZ3CO6B4775HNBFUUX6U/action/citation_signature","submit_replication":"https://pith.science/pith/AXLQSRTZ3CO6B4775HNBFUUX6U/action/replication_record"}},"created_at":"2026-05-18T02:49:46.743744+00:00","updated_at":"2026-05-18T02:49:46.743744+00:00"}