{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:N6YE2DBROAS4CMUOWUAPAXMN7O","short_pith_number":"pith:N6YE2DBR","canonical_record":{"source":{"id":"1207.2189","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-09T21:47:13Z","cross_cats_sorted":[],"title_canon_sha256":"e2f1ec6cf5f438369cc26bc56fbdaebd2eaf2ee7c64c595fcdae07d94b134f48","abstract_canon_sha256":"e009d2c6c16f5244a1849e91523b4b7d678c1288abe311e3c00e20383b61c2ea"},"schema_version":"1.0"},"canonical_sha256":"6fb04d0c317025c1328eb500f05d8dfb83d1b1cb7e26ee11834021f328afc8a7","source":{"kind":"arxiv","id":"1207.2189","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2189","created_at":"2026-05-18T03:00:27Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2189v3","created_at":"2026-05-18T03:00:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2189","created_at":"2026-05-18T03:00:27Z"},{"alias_kind":"pith_short_12","alias_value":"N6YE2DBROAS4","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"N6YE2DBROAS4CMUO","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"N6YE2DBR","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:N6YE2DBROAS4CMUOWUAPAXMN7O","target":"record","payload":{"canonical_record":{"source":{"id":"1207.2189","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-09T21:47:13Z","cross_cats_sorted":[],"title_canon_sha256":"e2f1ec6cf5f438369cc26bc56fbdaebd2eaf2ee7c64c595fcdae07d94b134f48","abstract_canon_sha256":"e009d2c6c16f5244a1849e91523b4b7d678c1288abe311e3c00e20383b61c2ea"},"schema_version":"1.0"},"canonical_sha256":"6fb04d0c317025c1328eb500f05d8dfb83d1b1cb7e26ee11834021f328afc8a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:27.001381Z","signature_b64":"KQTHF1v1TLJxJrYG89ORk6kyGsj8UBOrKHMdns+BNt1B31fiLWlZZt8djB/po8JNf4DwwAK4BxWRfzbJd9prDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fb04d0c317025c1328eb500f05d8dfb83d1b1cb7e26ee11834021f328afc8a7","last_reissued_at":"2026-05-18T03:00:27.000549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:27.000549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.2189","source_version":3,"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-18T03:00:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"97wWEwArgKHV8UURbli9y7gm3ATqlH9bUhq8v4Occo+72NYo10Dxz2t7Fz7UpApClxj9Hvg3H2VZI3sH1qclAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:29:30.899193Z"},"content_sha256":"06f0b7e3296e9f81010f11310744ae7dcc96e0a786eb897a7a1d37fa969c88de","schema_version":"1.0","event_id":"sha256:06f0b7e3296e9f81010f11310744ae7dcc96e0a786eb897a7a1d37fa969c88de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:N6YE2DBROAS4CMUOWUAPAXMN7O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reordering Rows for Better Compression: Beyond the Lexicographic Order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Daniel Lemire, Eduardo Gutarra, Owen Kaser","submitted_at":"2012-07-09T21:47:13Z","abstract_excerpt":"Sorting database tables before compressing them improves the compression rate. Can we do better than the lexicographical order? For minimizing the number of runs in a run-length encoding compression scheme, the best approaches to row-ordering are derived from traveling salesman heuristics, although there is a significant trade-off between running time and compression. A new heuristic, Multiple Lists, which is a variant on Nearest Neighbor that trades off compression for a major running-time speedup, is a good option for very large tables. However, for some compression schemes, it is more impor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2189","kind":"arxiv","version":3},"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-18T03:00:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8PxT9FLfyqpcQNW7hGgSOgRN+AKMDjas59yzHuj3l3XwcvKNUASQ+2mt1xnZW+j19DqjlvIxmCaqq3RbFhaaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:29:30.899706Z"},"content_sha256":"04d3e3bf2a81e91abf316f9fbbb0a3f290837b88afac736bb60e43d8e2c0b5f0","schema_version":"1.0","event_id":"sha256:04d3e3bf2a81e91abf316f9fbbb0a3f290837b88afac736bb60e43d8e2c0b5f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N6YE2DBROAS4CMUOWUAPAXMN7O/bundle.json","state_url":"https://pith.science/pith/N6YE2DBROAS4CMUOWUAPAXMN7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N6YE2DBROAS4CMUOWUAPAXMN7O/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-26T22:29:30Z","links":{"resolver":"https://pith.science/pith/N6YE2DBROAS4CMUOWUAPAXMN7O","bundle":"https://pith.science/pith/N6YE2DBROAS4CMUOWUAPAXMN7O/bundle.json","state":"https://pith.science/pith/N6YE2DBROAS4CMUOWUAPAXMN7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N6YE2DBROAS4CMUOWUAPAXMN7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:N6YE2DBROAS4CMUOWUAPAXMN7O","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":"e009d2c6c16f5244a1849e91523b4b7d678c1288abe311e3c00e20383b61c2ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-09T21:47:13Z","title_canon_sha256":"e2f1ec6cf5f438369cc26bc56fbdaebd2eaf2ee7c64c595fcdae07d94b134f48"},"schema_version":"1.0","source":{"id":"1207.2189","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2189","created_at":"2026-05-18T03:00:27Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2189v3","created_at":"2026-05-18T03:00:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2189","created_at":"2026-05-18T03:00:27Z"},{"alias_kind":"pith_short_12","alias_value":"N6YE2DBROAS4","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"N6YE2DBROAS4CMUO","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"N6YE2DBR","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:04d3e3bf2a81e91abf316f9fbbb0a3f290837b88afac736bb60e43d8e2c0b5f0","target":"graph","created_at":"2026-05-18T03:00:27Z","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":"Sorting database tables before compressing them improves the compression rate. Can we do better than the lexicographical order? For minimizing the number of runs in a run-length encoding compression scheme, the best approaches to row-ordering are derived from traveling salesman heuristics, although there is a significant trade-off between running time and compression. A new heuristic, Multiple Lists, which is a variant on Nearest Neighbor that trades off compression for a major running-time speedup, is a good option for very large tables. However, for some compression schemes, it is more impor","authors_text":"Daniel Lemire, Eduardo Gutarra, Owen Kaser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-09T21:47:13Z","title":"Reordering Rows for Better Compression: Beyond the Lexicographic Order"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2189","kind":"arxiv","version":3},"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:06f0b7e3296e9f81010f11310744ae7dcc96e0a786eb897a7a1d37fa969c88de","target":"record","created_at":"2026-05-18T03:00:27Z","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":"e009d2c6c16f5244a1849e91523b4b7d678c1288abe311e3c00e20383b61c2ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-09T21:47:13Z","title_canon_sha256":"e2f1ec6cf5f438369cc26bc56fbdaebd2eaf2ee7c64c595fcdae07d94b134f48"},"schema_version":"1.0","source":{"id":"1207.2189","kind":"arxiv","version":3}},"canonical_sha256":"6fb04d0c317025c1328eb500f05d8dfb83d1b1cb7e26ee11834021f328afc8a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fb04d0c317025c1328eb500f05d8dfb83d1b1cb7e26ee11834021f328afc8a7","first_computed_at":"2026-05-18T03:00:27.000549Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:27.000549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KQTHF1v1TLJxJrYG89ORk6kyGsj8UBOrKHMdns+BNt1B31fiLWlZZt8djB/po8JNf4DwwAK4BxWRfzbJd9prDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:27.001381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.2189","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06f0b7e3296e9f81010f11310744ae7dcc96e0a786eb897a7a1d37fa969c88de","sha256:04d3e3bf2a81e91abf316f9fbbb0a3f290837b88afac736bb60e43d8e2c0b5f0"],"state_sha256":"51c74958c609d0aa011f0b97c96de0bb5cd2e4acde37f61e40ad0b5e7c01bbe1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CxMOr1HbcLW9E6I/4tz+2mVsKNccuPe+DGG3KEm363RlpXlcMJkxp4V51TpcQm5yZqMNeKKQqYlcPib5RgusBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:29:30.902644Z","bundle_sha256":"a44b1d83b4ccb59f27713c397d032c41f87ef0cc65fcab36021e7af1b0fd46a8"}}