{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:L7XCWCPGNZKUEPRSSPVPM74EFE","short_pith_number":"pith:L7XCWCPG","schema_version":"1.0","canonical_sha256":"5fee2b09e66e55423e3293eaf67f84293ef66f95f32a16b7a0e249f3f91c3a10","source":{"kind":"arxiv","id":"2607.28136","version":1},"attestation_state":"computed","paper":{"title":"Extended Depth-First Representations of $k^2$-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.PF"],"primary_cat":"cs.DS","authors_text":"Francesco Tosoni, Gabriel Carmona, Giovanni Manzini, Paolo Ferragina","submitted_at":"2026-07-30T12:45:49Z","abstract_excerpt":"In this paper, we study static, computation-friendly, lossless compression formats for graphs, focusing on memory locality and operational efficiency of $k^2$-trees. We observe that their traditional level-wise layouts suffer from poor cache performance due to weak locality, especially in operations such as matrix-vector and matrix-matrix operations. To address this limitation, we propose four depth-first representations of $k^2$-trees: a plain depth-first layout (EDF-1), a balanced-parenthesis representation (BP), and their compressed variants (CEDF and CBP). We further introduce a linear-tim"},"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":"2607.28136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-30T12:45:49Z","cross_cats_sorted":["cs.IR","cs.PF"],"title_canon_sha256":"fb599aeabf833885a220b60b1ee7b9dad3076b805233bf50508f5a5fea332282","abstract_canon_sha256":"478d3d9ab802b866ef05d9a199caa1ef659e37a67d09a53d33364b513e175e15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fee2b09e66e55423e3293eaf67f84293ef66f95f32a16b7a0e249f3f91c3a10","last_reissued_at":"2026-07-31T01:35:50.811618Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:35:50.811618Z"},"graph_snapshot":{"paper":{"title":"Extended Depth-First Representations of $k^2$-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.PF"],"primary_cat":"cs.DS","authors_text":"Francesco Tosoni, Gabriel Carmona, Giovanni Manzini, Paolo Ferragina","submitted_at":"2026-07-30T12:45:49Z","abstract_excerpt":"In this paper, we study static, computation-friendly, lossless compression formats for graphs, focusing on memory locality and operational efficiency of $k^2$-trees. We observe that their traditional level-wise layouts suffer from poor cache performance due to weak locality, especially in operations such as matrix-vector and matrix-matrix operations. To address this limitation, we propose four depth-first representations of $k^2$-trees: a plain depth-first layout (EDF-1), a balanced-parenthesis representation (BP), and their compressed variants (CEDF and CBP). We further introduce a linear-tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28136","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/2607.28136/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":"2607.28136","created_at":"2026-07-31T01:35:50.814821+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.28136v1","created_at":"2026-07-31T01:35:50.814821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28136","created_at":"2026-07-31T01:35:50.814821+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7XCWCPGNZKU","created_at":"2026-07-31T01:35:50.814821+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7XCWCPGNZKUEPRS","created_at":"2026-07-31T01:35:50.814821+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7XCWCPG","created_at":"2026-07-31T01:35:50.814821+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/L7XCWCPGNZKUEPRSSPVPM74EFE","json":"https://pith.science/pith/L7XCWCPGNZKUEPRSSPVPM74EFE.json","graph_json":"https://pith.science/api/pith-number/L7XCWCPGNZKUEPRSSPVPM74EFE/graph.json","events_json":"https://pith.science/api/pith-number/L7XCWCPGNZKUEPRSSPVPM74EFE/events.json","paper":"https://pith.science/paper/L7XCWCPG"},"agent_actions":{"view_html":"https://pith.science/pith/L7XCWCPGNZKUEPRSSPVPM74EFE","download_json":"https://pith.science/pith/L7XCWCPGNZKUEPRSSPVPM74EFE.json","view_paper":"https://pith.science/paper/L7XCWCPG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.28136&json=true","fetch_graph":"https://pith.science/api/pith-number/L7XCWCPGNZKUEPRSSPVPM74EFE/graph.json","fetch_events":"https://pith.science/api/pith-number/L7XCWCPGNZKUEPRSSPVPM74EFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7XCWCPGNZKUEPRSSPVPM74EFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7XCWCPGNZKUEPRSSPVPM74EFE/action/storage_attestation","attest_author":"https://pith.science/pith/L7XCWCPGNZKUEPRSSPVPM74EFE/action/author_attestation","sign_citation":"https://pith.science/pith/L7XCWCPGNZKUEPRSSPVPM74EFE/action/citation_signature","submit_replication":"https://pith.science/pith/L7XCWCPGNZKUEPRSSPVPM74EFE/action/replication_record"}},"created_at":"2026-07-31T01:35:50.814821+00:00","updated_at":"2026-07-31T01:35:50.814821+00:00"}