{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AXLQSRTZ3CO6B4775HNBFUUX6U","short_pith_number":"pith:AXLQSRTZ","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"},"canonical_sha256":"05d7094679d89de0f3ffe9da12d297f536c2bb43b426ff290a2d235dde2ed80a","source":{"kind":"arxiv","id":"1406.3411","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3411","created_at":"2026-05-18T02:49:46Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3411v1","created_at":"2026-05-18T02:49:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3411","created_at":"2026-05-18T02:49:46Z"},{"alias_kind":"pith_short_12","alias_value":"AXLQSRTZ3CO6","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AXLQSRTZ3CO6B477","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AXLQSRTZ","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AXLQSRTZ3CO6B4775HNBFUUX6U","target":"record","payload":{"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"},"canonical_sha256":"05d7094679d89de0f3ffe9da12d297f536c2bb43b426ff290a2d235dde2ed80a","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"},"source_kind":"arxiv","source_id":"1406.3411","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-18T02:49:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zxWR2dJtX+2Hm/F4L6yoisPHrEIuKJDx8MkNeG2/UANF6zMFKCtowdSgfdJgoZwHcFPvOmf74+jOCKfu9uRsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:34:50.410454Z"},"content_sha256":"c03dd8153d610fbc6701c3b21d9bfc7fdc43bcf86bdf4fa9bd12b2942a16d2e8","schema_version":"1.0","event_id":"sha256:c03dd8153d610fbc6701c3b21d9bfc7fdc43bcf86bdf4fa9bd12b2942a16d2e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AXLQSRTZ3CO6B4775HNBFUUX6U","target":"graph","payload":{"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"},"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-18T02:49:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Z6uAHqvtXklvtp26F1lwOehSacS7fJFvZunxOhxJ+NTML1FqasDjW4qozHtAsE4MtdTUceDeroAMzeV9BiCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:34:50.411274Z"},"content_sha256":"38af23a1032f8b6ac03e5ec41fe726447839150e286765a920ddeb832749e0d5","schema_version":"1.0","event_id":"sha256:38af23a1032f8b6ac03e5ec41fe726447839150e286765a920ddeb832749e0d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AXLQSRTZ3CO6B4775HNBFUUX6U/bundle.json","state_url":"https://pith.science/pith/AXLQSRTZ3CO6B4775HNBFUUX6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AXLQSRTZ3CO6B4775HNBFUUX6U/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-05-31T23:34:50Z","links":{"resolver":"https://pith.science/pith/AXLQSRTZ3CO6B4775HNBFUUX6U","bundle":"https://pith.science/pith/AXLQSRTZ3CO6B4775HNBFUUX6U/bundle.json","state":"https://pith.science/pith/AXLQSRTZ3CO6B4775HNBFUUX6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AXLQSRTZ3CO6B4775HNBFUUX6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AXLQSRTZ3CO6B4775HNBFUUX6U","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":"48c949b20323c19c8c6cd82d551b1db57e5244fdb3ac95cffc9c1cb71a5bb273","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-06-13T03:19:42Z","title_canon_sha256":"d89f22c460face04141bc1e2e02bd2ec7d7f168e14ce4b7d54d838669fbf1403"},"schema_version":"1.0","source":{"id":"1406.3411","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3411","created_at":"2026-05-18T02:49:46Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3411v1","created_at":"2026-05-18T02:49:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3411","created_at":"2026-05-18T02:49:46Z"},{"alias_kind":"pith_short_12","alias_value":"AXLQSRTZ3CO6","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AXLQSRTZ3CO6B477","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AXLQSRTZ","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:38af23a1032f8b6ac03e5ec41fe726447839150e286765a920ddeb832749e0d5","target":"graph","created_at":"2026-05-18T02:49:46Z","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":"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 ","authors_text":"Christos Faloutsos, Danai Koutra, Jilles Vreeken, U Kang","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-06-13T03:19:42Z","title":"VoG: Summarizing and Understanding Large Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3411","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:c03dd8153d610fbc6701c3b21d9bfc7fdc43bcf86bdf4fa9bd12b2942a16d2e8","target":"record","created_at":"2026-05-18T02:49:46Z","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":"48c949b20323c19c8c6cd82d551b1db57e5244fdb3ac95cffc9c1cb71a5bb273","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-06-13T03:19:42Z","title_canon_sha256":"d89f22c460face04141bc1e2e02bd2ec7d7f168e14ce4b7d54d838669fbf1403"},"schema_version":"1.0","source":{"id":"1406.3411","kind":"arxiv","version":1}},"canonical_sha256":"05d7094679d89de0f3ffe9da12d297f536c2bb43b426ff290a2d235dde2ed80a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05d7094679d89de0f3ffe9da12d297f536c2bb43b426ff290a2d235dde2ed80a","first_computed_at":"2026-05-18T02:49:46.743666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:46.743666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uwh8Xo7ANSyB//Mkp5ISFaH0zrcmB6aDxayrmp9Zwn/7Bo+kOzu2bjlw1i1S+A8dtLZyDixSF0FSA18JxP4zCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:46.744168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.3411","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c03dd8153d610fbc6701c3b21d9bfc7fdc43bcf86bdf4fa9bd12b2942a16d2e8","sha256:38af23a1032f8b6ac03e5ec41fe726447839150e286765a920ddeb832749e0d5"],"state_sha256":"060d4df44ea48be4c8ad7f048d917700b993e35e1b0cd9a112252adde8abee9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"86SlMWoUKW6ZJ72oggQ+GKCgUla7e1gSEBCyNZD9S1kzy3lsLUVOH7ZyDTlb8NlBswJYk6GQE2uP1Zm8GDjIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:34:50.415840Z","bundle_sha256":"e71911c9afa1ba89ab0b330185d23fbafb4cabdee139319d89cdf9141d7696ca"}}