{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:HKNHGIXO2SLTKYP3HUF4QLGJGQ","short_pith_number":"pith:HKNHGIXO","canonical_record":{"source":{"id":"1011.5425","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-24T16:49:34Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"7be707a64afb952f6718cc1164b9fd0c8be507e3f35c4e94c7bfc82f452d3260","abstract_canon_sha256":"44e5f4037017dc8a01983c73ee13427107b06bfdd4fe78f3c44079a001c6d4ee"},"schema_version":"1.0"},"canonical_sha256":"3a9a7322eed4973561fb3d0bc82cc9340be6630a3ab3166693cc09c935b97de1","source":{"kind":"arxiv","id":"1011.5425","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5425","created_at":"2026-05-18T04:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5425v2","created_at":"2026-05-18T04:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5425","created_at":"2026-05-18T04:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"HKNHGIXO2SLT","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HKNHGIXO2SLTKYP3","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HKNHGIXO","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:HKNHGIXO2SLTKYP3HUF4QLGJGQ","target":"record","payload":{"canonical_record":{"source":{"id":"1011.5425","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-24T16:49:34Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"7be707a64afb952f6718cc1164b9fd0c8be507e3f35c4e94c7bfc82f452d3260","abstract_canon_sha256":"44e5f4037017dc8a01983c73ee13427107b06bfdd4fe78f3c44079a001c6d4ee"},"schema_version":"1.0"},"canonical_sha256":"3a9a7322eed4973561fb3d0bc82cc9340be6630a3ab3166693cc09c935b97de1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:58.769871Z","signature_b64":"K5RBRht48fw+28iawD8mcUlTunK6QsXrtFyaA7M/AF1UVDHQKZE/zZ8zBPnckF036vIWPr62R6ZqodPpdmSfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a9a7322eed4973561fb3d0bc82cc9340be6630a3ab3166693cc09c935b97de1","last_reissued_at":"2026-05-18T04:10:58.769419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:58.769419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.5425","source_version":2,"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-18T04:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Km7OGrdv1RKG+uaW+Q851EpcHX7s1O4f/jySA+CrL+oVg9lckpeNdPiPFljAaNSU9FAPP7UZgqimQzF8B3UsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:20:53.860721Z"},"content_sha256":"27cd00c3e5e1baf9efec8a5215ccb0e03c15b362aedcbf26a5324dbaf4db7e6c","schema_version":"1.0","event_id":"sha256:27cd00c3e5e1baf9efec8a5215ccb0e03c15b362aedcbf26a5324dbaf4db7e6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:HKNHGIXO2SLTKYP3HUF4QLGJGQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cs.DS","authors_text":"Marco Rosa, Massimo Santini, Paolo Boldi, Sebastiano Vigna","submitted_at":"2010-11-24T16:49:34Z","abstract_excerpt":"We continue the line of research on graph compression started with WebGraph, but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the approaches that have been used for a long time to compress web graphs rely on a specific ordering of the nodes (lexicographical URL ordering) whose extension to general social networks is not trivial. In this paper, we propose a solution that mixes clusterings and orders, and devise a new algorithm, called Layered Label Propagation, that builds on previous work on scalable clustering and can be used to reorder very l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5425","kind":"arxiv","version":2},"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-18T04:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ohxbcomDNbylELpfFx1blpqWMbQdoAiVURfV/BR8olq12/DK4prJvfRczuAgGn/u+QkPQBSNHCpJulZD7DbFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:20:53.861406Z"},"content_sha256":"34d0616bc76c970837de3fa1395745ada41021af3d6eb6d1c58e419dca94b88c","schema_version":"1.0","event_id":"sha256:34d0616bc76c970837de3fa1395745ada41021af3d6eb6d1c58e419dca94b88c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HKNHGIXO2SLTKYP3HUF4QLGJGQ/bundle.json","state_url":"https://pith.science/pith/HKNHGIXO2SLTKYP3HUF4QLGJGQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HKNHGIXO2SLTKYP3HUF4QLGJGQ/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-05T02:20:53Z","links":{"resolver":"https://pith.science/pith/HKNHGIXO2SLTKYP3HUF4QLGJGQ","bundle":"https://pith.science/pith/HKNHGIXO2SLTKYP3HUF4QLGJGQ/bundle.json","state":"https://pith.science/pith/HKNHGIXO2SLTKYP3HUF4QLGJGQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HKNHGIXO2SLTKYP3HUF4QLGJGQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:HKNHGIXO2SLTKYP3HUF4QLGJGQ","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":"44e5f4037017dc8a01983c73ee13427107b06bfdd4fe78f3c44079a001c6d4ee","cross_cats_sorted":["cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-24T16:49:34Z","title_canon_sha256":"7be707a64afb952f6718cc1164b9fd0c8be507e3f35c4e94c7bfc82f452d3260"},"schema_version":"1.0","source":{"id":"1011.5425","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5425","created_at":"2026-05-18T04:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5425v2","created_at":"2026-05-18T04:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5425","created_at":"2026-05-18T04:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"HKNHGIXO2SLT","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HKNHGIXO2SLTKYP3","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HKNHGIXO","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:34d0616bc76c970837de3fa1395745ada41021af3d6eb6d1c58e419dca94b88c","target":"graph","created_at":"2026-05-18T04:10:58Z","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":"We continue the line of research on graph compression started with WebGraph, but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the approaches that have been used for a long time to compress web graphs rely on a specific ordering of the nodes (lexicographical URL ordering) whose extension to general social networks is not trivial. In this paper, we propose a solution that mixes clusterings and orders, and devise a new algorithm, called Layered Label Propagation, that builds on previous work on scalable clustering and can be used to reorder very l","authors_text":"Marco Rosa, Massimo Santini, Paolo Boldi, Sebastiano Vigna","cross_cats":["cs.SI","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-24T16:49:34Z","title":"Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5425","kind":"arxiv","version":2},"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:27cd00c3e5e1baf9efec8a5215ccb0e03c15b362aedcbf26a5324dbaf4db7e6c","target":"record","created_at":"2026-05-18T04:10:58Z","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":"44e5f4037017dc8a01983c73ee13427107b06bfdd4fe78f3c44079a001c6d4ee","cross_cats_sorted":["cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-24T16:49:34Z","title_canon_sha256":"7be707a64afb952f6718cc1164b9fd0c8be507e3f35c4e94c7bfc82f452d3260"},"schema_version":"1.0","source":{"id":"1011.5425","kind":"arxiv","version":2}},"canonical_sha256":"3a9a7322eed4973561fb3d0bc82cc9340be6630a3ab3166693cc09c935b97de1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a9a7322eed4973561fb3d0bc82cc9340be6630a3ab3166693cc09c935b97de1","first_computed_at":"2026-05-18T04:10:58.769419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:58.769419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K5RBRht48fw+28iawD8mcUlTunK6QsXrtFyaA7M/AF1UVDHQKZE/zZ8zBPnckF036vIWPr62R6ZqodPpdmSfDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:58.769871Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5425","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27cd00c3e5e1baf9efec8a5215ccb0e03c15b362aedcbf26a5324dbaf4db7e6c","sha256:34d0616bc76c970837de3fa1395745ada41021af3d6eb6d1c58e419dca94b88c"],"state_sha256":"a4fa8ff40e2c46edac0b1769947d7cca187108e31f584d6cbf431a15afb384a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rFSscMMfVfcuk6WCOy5MJSf0qdrkUo9sA4SvQaw9an+lK8tMxjH6K+k1VmlXtk0B42oHOZlK/dPOOg+ao7pZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:20:53.865087Z","bundle_sha256":"731d12f81a890d5c6bb76e77465b4d9d615d1ab926aa80e0e9e53e417dd07b5d"}}