{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ND3G2VP5E4SGTKD7PCXKTMRKMN","short_pith_number":"pith:ND3G2VP5","schema_version":"1.0","canonical_sha256":"68f66d55fd272469a87f78aea9b22a63402063bcf33a48e1267414c3b2dc894b","source":{"kind":"arxiv","id":"2605.21510","version":1},"attestation_state":"computed","paper":{"title":"Community-Aware Vertex Ordering for Reference-Based Graph Compression: A Cross-Encoder Empirical Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Jimmy Dubuisson","submitted_at":"2026-05-13T10:38:31Z","abstract_excerpt":"Reference-based graph compression encodes each vertex's neighbor list relative to a recent vertex, exploiting locality to compress large directed graphs. The dominant tool, WebGraph's BVGraph, fixes a single encoding pipeline and relies on a separately chosen vertex ordering -- typically URL-lexicographic or Layered Label Propagation (LLP). The interaction between ordering and encoder is rarely measured.\n  We propose a two-stage Leiden+LLP vertex ordering -- global LLP to seed labels, Leiden community detection, then per-cluster LLP on each induced subgraph -- and study how it interacts with r"},"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":"2605.21510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-05-13T10:38:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4e201249487b40f333e1b97b13e53c7b594cc57c739839985f18f593d708301b","abstract_canon_sha256":"b9c2b4ff04f8665c35cb3c8261725f6895a7a85d71a2acd296a66ef8bd236f52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T00:02:27.302434Z","signature_b64":"aNCpEyxaitTNYLtFF1h2YovzyerT2P72fxh4eDiaRs1797GBLQYiFGzYYQrb4zoS0GfSrmaP36+vvgtJzg9rCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68f66d55fd272469a87f78aea9b22a63402063bcf33a48e1267414c3b2dc894b","last_reissued_at":"2026-05-22T00:02:27.302031Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T00:02:27.302031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Community-Aware Vertex Ordering for Reference-Based Graph Compression: A Cross-Encoder Empirical Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Jimmy Dubuisson","submitted_at":"2026-05-13T10:38:31Z","abstract_excerpt":"Reference-based graph compression encodes each vertex's neighbor list relative to a recent vertex, exploiting locality to compress large directed graphs. The dominant tool, WebGraph's BVGraph, fixes a single encoding pipeline and relies on a separately chosen vertex ordering -- typically URL-lexicographic or Layered Label Propagation (LLP). The interaction between ordering and encoder is rarely measured.\n  We propose a two-stage Leiden+LLP vertex ordering -- global LLP to seed labels, Leiden community detection, then per-cluster LLP on each induced subgraph -- and study how it interacts with r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21510","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.21510/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.21510","created_at":"2026-05-22T00:02:27.302085+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.21510v1","created_at":"2026-05-22T00:02:27.302085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21510","created_at":"2026-05-22T00:02:27.302085+00:00"},{"alias_kind":"pith_short_12","alias_value":"ND3G2VP5E4SG","created_at":"2026-05-22T00:02:27.302085+00:00"},{"alias_kind":"pith_short_16","alias_value":"ND3G2VP5E4SGTKD7","created_at":"2026-05-22T00:02:27.302085+00:00"},{"alias_kind":"pith_short_8","alias_value":"ND3G2VP5","created_at":"2026-05-22T00:02:27.302085+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/ND3G2VP5E4SGTKD7PCXKTMRKMN","json":"https://pith.science/pith/ND3G2VP5E4SGTKD7PCXKTMRKMN.json","graph_json":"https://pith.science/api/pith-number/ND3G2VP5E4SGTKD7PCXKTMRKMN/graph.json","events_json":"https://pith.science/api/pith-number/ND3G2VP5E4SGTKD7PCXKTMRKMN/events.json","paper":"https://pith.science/paper/ND3G2VP5"},"agent_actions":{"view_html":"https://pith.science/pith/ND3G2VP5E4SGTKD7PCXKTMRKMN","download_json":"https://pith.science/pith/ND3G2VP5E4SGTKD7PCXKTMRKMN.json","view_paper":"https://pith.science/paper/ND3G2VP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.21510&json=true","fetch_graph":"https://pith.science/api/pith-number/ND3G2VP5E4SGTKD7PCXKTMRKMN/graph.json","fetch_events":"https://pith.science/api/pith-number/ND3G2VP5E4SGTKD7PCXKTMRKMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ND3G2VP5E4SGTKD7PCXKTMRKMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ND3G2VP5E4SGTKD7PCXKTMRKMN/action/storage_attestation","attest_author":"https://pith.science/pith/ND3G2VP5E4SGTKD7PCXKTMRKMN/action/author_attestation","sign_citation":"https://pith.science/pith/ND3G2VP5E4SGTKD7PCXKTMRKMN/action/citation_signature","submit_replication":"https://pith.science/pith/ND3G2VP5E4SGTKD7PCXKTMRKMN/action/replication_record"}},"created_at":"2026-05-22T00:02:27.302085+00:00","updated_at":"2026-05-22T00:02:27.302085+00:00"}