{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:L7XCWCPGNZKUEPRSSPVPM74EFE","short_pith_number":"pith:L7XCWCPG","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"},"canonical_sha256":"5fee2b09e66e55423e3293eaf67f84293ef66f95f32a16b7a0e249f3f91c3a10","source":{"kind":"arxiv","id":"2607.28136","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28136","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28136v1","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28136","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"pith_short_12","alias_value":"L7XCWCPGNZKU","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"pith_short_16","alias_value":"L7XCWCPGNZKUEPRS","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"pith_short_8","alias_value":"L7XCWCPG","created_at":"2026-07-31T01:35:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:L7XCWCPGNZKUEPRSSPVPM74EFE","target":"record","payload":{"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"},"canonical_sha256":"5fee2b09e66e55423e3293eaf67f84293ef66f95f32a16b7a0e249f3f91c3a10","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"},"source_kind":"arxiv","source_id":"2607.28136","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-07-31T01:35:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nF5u37eHIqQTvJOUrkKmum//vxfLupOXLIvz/UP3Y8Ofw/jfDzRiswQvQzByfQJQ7mphn7RX8Ow0n0DdrrPkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T19:50:30.945620Z"},"content_sha256":"379f833f061821e4522e8e0b68b5d0df0a96dc731030e73e79aca6510c61f4ba","schema_version":"1.0","event_id":"sha256:379f833f061821e4522e8e0b68b5d0df0a96dc731030e73e79aca6510c61f4ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:L7XCWCPGNZKUEPRSSPVPM74EFE","target":"graph","payload":{"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"},"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-07-31T01:35:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3zzuaQNrJtERaw+xexIyEP8TTHq3MwCu1nAaMfsll0LTSsqCYSnmdzMa2k4EercIAEHCsAT2a9jrFglfD+pRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T19:50:30.945984Z"},"content_sha256":"4498f9305fbae5aec14149a9f226be4105d0902f29516dda585ae36c4e3840db","schema_version":"1.0","event_id":"sha256:4498f9305fbae5aec14149a9f226be4105d0902f29516dda585ae36c4e3840db"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:L7XCWCPGNZKUEPRSSPVPM74EFE","target":"integrity","payload":{"note":"Identifier '10.5555/1076819' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. The 43 Morgan Kaufmann Series in Computer Graphics and Geometric Modeling. Mor- gan Kaufmann Publishers Inc., San Francisco (2005). https://doi.org/10.5555/ 1076819 .htt","arxiv_id":"2607.28136","detector":"doi_compliance","evidence":{"doi":"10.5555/1076819","arxiv_id":null,"ref_index":54,"raw_excerpt":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. The 43 Morgan Kaufmann Series in Computer Graphics and Geometric Modeling. Mor- gan Kaufmann Publishers Inc., San Francisco (2005). https://doi.org/10.5555/ 1076819 .https://doi.org/10.5555/1076819","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":54,"audited_at":"2026-07-31T16:51:42.462309Z","event_type":"pith.integrity.v1","detected_doi":"10.5555/1076819","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"e50768afafdfe73f00ca36a7ac2e9d2cc99363360967b7ff2d93b07af290965d","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14452,"payload_sha256":"40d91efeb25039d31e9a5d8f3071a9b0bcc4b4a506cfe40a80b05d7f858d0c8a","signature_b64":"ecQzKteiM9CHp00kHD5P4LVsICD9BI3UUUuMD3lz2gozLQ1qZWVAfm7GEz/fg3hj2Q+lFVZ5CR5lkNqwryLCAA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-31T16:56:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lPepSYLUwsU77ZyS1rBtddXLetgRj+GULpwnBA/UpCsXca+/s+8dhv0bEqVx4hpZqgDmAxexR1vJ9iH0ARntCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T19:50:30.949189Z"},"content_sha256":"9042902f4e7e21c8a6fd0ab62673b11acc4a638fd377a8859ce56efacce54c3c","schema_version":"1.0","event_id":"sha256:9042902f4e7e21c8a6fd0ab62673b11acc4a638fd377a8859ce56efacce54c3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7XCWCPGNZKUEPRSSPVPM74EFE/bundle.json","state_url":"https://pith.science/pith/L7XCWCPGNZKUEPRSSPVPM74EFE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7XCWCPGNZKUEPRSSPVPM74EFE/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-08-01T19:50:30Z","links":{"resolver":"https://pith.science/pith/L7XCWCPGNZKUEPRSSPVPM74EFE","bundle":"https://pith.science/pith/L7XCWCPGNZKUEPRSSPVPM74EFE/bundle.json","state":"https://pith.science/pith/L7XCWCPGNZKUEPRSSPVPM74EFE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7XCWCPGNZKUEPRSSPVPM74EFE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:L7XCWCPGNZKUEPRSSPVPM74EFE","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"478d3d9ab802b866ef05d9a199caa1ef659e37a67d09a53d33364b513e175e15","cross_cats_sorted":["cs.IR","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-30T12:45:49Z","title_canon_sha256":"fb599aeabf833885a220b60b1ee7b9dad3076b805233bf50508f5a5fea332282"},"schema_version":"1.0","source":{"id":"2607.28136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28136","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28136v1","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28136","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"pith_short_12","alias_value":"L7XCWCPGNZKU","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"pith_short_16","alias_value":"L7XCWCPGNZKUEPRS","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"pith_short_8","alias_value":"L7XCWCPG","created_at":"2026-07-31T01:35:50Z"}],"graph_snapshots":[{"event_id":"sha256:4498f9305fbae5aec14149a9f226be4105d0902f29516dda585ae36c4e3840db","target":"graph","created_at":"2026-07-31T01:35:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.28136/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Francesco Tosoni, Gabriel Carmona, Giovanni Manzini, Paolo Ferragina","cross_cats":["cs.IR","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-30T12:45:49Z","title":"Extended Depth-First Representations of $k^2$-trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28136","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:379f833f061821e4522e8e0b68b5d0df0a96dc731030e73e79aca6510c61f4ba","target":"record","created_at":"2026-07-31T01:35:50Z","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":"478d3d9ab802b866ef05d9a199caa1ef659e37a67d09a53d33364b513e175e15","cross_cats_sorted":["cs.IR","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-30T12:45:49Z","title_canon_sha256":"fb599aeabf833885a220b60b1ee7b9dad3076b805233bf50508f5a5fea332282"},"schema_version":"1.0","source":{"id":"2607.28136","kind":"arxiv","version":1}},"canonical_sha256":"5fee2b09e66e55423e3293eaf67f84293ef66f95f32a16b7a0e249f3f91c3a10","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fee2b09e66e55423e3293eaf67f84293ef66f95f32a16b7a0e249f3f91c3a10","first_computed_at":"2026-07-31T01:35:50.811618Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:35:50.811618Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.28136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:379f833f061821e4522e8e0b68b5d0df0a96dc731030e73e79aca6510c61f4ba","sha256:4498f9305fbae5aec14149a9f226be4105d0902f29516dda585ae36c4e3840db","sha256:9042902f4e7e21c8a6fd0ab62673b11acc4a638fd377a8859ce56efacce54c3c"],"state_sha256":"e8b7fa1b0f6b930b18cce159403048fc8dada301994e8dd249364a4e4b1c65db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gz2cfn1HdtPweIkkbm/z2IihzmjuRzrzdrvW9XnErm5sfhn9x17gPehi/Gm4/41GTEu8RM5F6tN+M4pu5wTSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T19:50:30.950682Z","bundle_sha256":"0d84154179922dfb665e9d8258b00f624db630dc7378a38b1ed9a4e4959fc34b"}}