{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VZTOMRV64GWGBCT2PRWTIALPJS","short_pith_number":"pith:VZTOMRV6","canonical_record":{"source":{"id":"1204.1407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-06T04:50:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"89fe3908233c7416feb22cf56f14efd0528beecb5c546d369733f1c4979d8995","abstract_canon_sha256":"d000d43d97a3de8add58e8810bb3b0f10aef9685cf9df884e163a211249289ca"},"schema_version":"1.0"},"canonical_sha256":"ae66e646bee1ac608a7a7c6d34016f4c9135e8181330fa188217a58807069748","source":{"kind":"arxiv","id":"1204.1407","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1407","created_at":"2026-05-18T03:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1407v1","created_at":"2026-05-18T03:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1407","created_at":"2026-05-18T03:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"VZTOMRV64GWG","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VZTOMRV64GWGBCT2","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VZTOMRV6","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VZTOMRV64GWGBCT2PRWTIALPJS","target":"record","payload":{"canonical_record":{"source":{"id":"1204.1407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-06T04:50:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"89fe3908233c7416feb22cf56f14efd0528beecb5c546d369733f1c4979d8995","abstract_canon_sha256":"d000d43d97a3de8add58e8810bb3b0f10aef9685cf9df884e163a211249289ca"},"schema_version":"1.0"},"canonical_sha256":"ae66e646bee1ac608a7a7c6d34016f4c9135e8181330fa188217a58807069748","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:25.714287Z","signature_b64":"cj7Uo9/LuDYFYn6+qEBQYPsdHuvhpiMpBYbjXOhVbts9hblpvOsh29/GakbcNKPnehI0ILUJld6ogm8FeD3PBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae66e646bee1ac608a7a7c6d34016f4c9135e8181330fa188217a58807069748","last_reissued_at":"2026-05-18T03:58:25.713575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:25.713575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.1407","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-05-18T03:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4/pOpQjdlmRn9220EmhayR08PLfzRoeGdxRi2lHdnGEgXTV0ZbBWkjbHcZ+oQE2oc/l4h6mYLL5QFOBgFMepAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:52:10.916917Z"},"content_sha256":"3c8f5a9f2b04a91f715089857af44264e0ef68f4db525edbe5d312a3275ecc72","schema_version":"1.0","event_id":"sha256:3c8f5a9f2b04a91f715089857af44264e0ef68f4db525edbe5d312a3275ecc72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VZTOMRV64GWGBCT2PRWTIALPJS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Column Reordering for Box-Constrained Integer Least Squares Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Stephen Breen, Xiao-Wen Chang","submitted_at":"2012-04-06T04:50:09Z","abstract_excerpt":"The box-constrained integer least squares problem (BILS) arises in MIMO wireless communications applications. Typically a sphere decoding algorithm (a tree search algorithm) is used to solve the problem. In order to make the search algorithm more efficient, the columns of the channel matrix in the BILS problem have to be reordered. To our knowledge, there are currently two algorithms for column reordering that provide the best known results. Both use all available information, but they were derived respectively from geometric and algebraic points of view and look different. In this paper we mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1407","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":""},"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:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p6pCRi8kINAW1gxp4qb3pVdW+JwpH2naWIGrMbFiBTa41OgQK/7DDEexSY35tdfNoAtthlET/D+2Tyh2ih0sBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:52:10.917264Z"},"content_sha256":"5dc52ff3464d36a8451dc49d6928d86ef7d8e274b9364b0a44ee4960db5f454b","schema_version":"1.0","event_id":"sha256:5dc52ff3464d36a8451dc49d6928d86ef7d8e274b9364b0a44ee4960db5f454b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VZTOMRV64GWGBCT2PRWTIALPJS/bundle.json","state_url":"https://pith.science/pith/VZTOMRV64GWGBCT2PRWTIALPJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VZTOMRV64GWGBCT2PRWTIALPJS/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-10T19:52:10Z","links":{"resolver":"https://pith.science/pith/VZTOMRV64GWGBCT2PRWTIALPJS","bundle":"https://pith.science/pith/VZTOMRV64GWGBCT2PRWTIALPJS/bundle.json","state":"https://pith.science/pith/VZTOMRV64GWGBCT2PRWTIALPJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VZTOMRV64GWGBCT2PRWTIALPJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VZTOMRV64GWGBCT2PRWTIALPJS","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":"d000d43d97a3de8add58e8810bb3b0f10aef9685cf9df884e163a211249289ca","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-06T04:50:09Z","title_canon_sha256":"89fe3908233c7416feb22cf56f14efd0528beecb5c546d369733f1c4979d8995"},"schema_version":"1.0","source":{"id":"1204.1407","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1407","created_at":"2026-05-18T03:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1407v1","created_at":"2026-05-18T03:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1407","created_at":"2026-05-18T03:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"VZTOMRV64GWG","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VZTOMRV64GWGBCT2","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VZTOMRV6","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:5dc52ff3464d36a8451dc49d6928d86ef7d8e274b9364b0a44ee4960db5f454b","target":"graph","created_at":"2026-05-18T03:58:25Z","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":"The box-constrained integer least squares problem (BILS) arises in MIMO wireless communications applications. Typically a sphere decoding algorithm (a tree search algorithm) is used to solve the problem. In order to make the search algorithm more efficient, the columns of the channel matrix in the BILS problem have to be reordered. To our knowledge, there are currently two algorithms for column reordering that provide the best known results. Both use all available information, but they were derived respectively from geometric and algebraic points of view and look different. In this paper we mo","authors_text":"Stephen Breen, Xiao-Wen Chang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-06T04:50:09Z","title":"Column Reordering for Box-Constrained Integer Least Squares Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1407","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:3c8f5a9f2b04a91f715089857af44264e0ef68f4db525edbe5d312a3275ecc72","target":"record","created_at":"2026-05-18T03:58:25Z","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":"d000d43d97a3de8add58e8810bb3b0f10aef9685cf9df884e163a211249289ca","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-06T04:50:09Z","title_canon_sha256":"89fe3908233c7416feb22cf56f14efd0528beecb5c546d369733f1c4979d8995"},"schema_version":"1.0","source":{"id":"1204.1407","kind":"arxiv","version":1}},"canonical_sha256":"ae66e646bee1ac608a7a7c6d34016f4c9135e8181330fa188217a58807069748","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae66e646bee1ac608a7a7c6d34016f4c9135e8181330fa188217a58807069748","first_computed_at":"2026-05-18T03:58:25.713575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:25.713575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cj7Uo9/LuDYFYn6+qEBQYPsdHuvhpiMpBYbjXOhVbts9hblpvOsh29/GakbcNKPnehI0ILUJld6ogm8FeD3PBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:25.714287Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.1407","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c8f5a9f2b04a91f715089857af44264e0ef68f4db525edbe5d312a3275ecc72","sha256:5dc52ff3464d36a8451dc49d6928d86ef7d8e274b9364b0a44ee4960db5f454b"],"state_sha256":"3bc7d05125dba2363bec5201a45c0b5714648dcc11ce13a86a1d33f0458a3d1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LIi8xUGM46CzijJYpprkFhAi8Y0JlOYevGPOY+SQ2NRxopCvp8NWgwO4d5mCambmlJ3AUcH8TmpZFKFHacIVDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:52:10.919196Z","bundle_sha256":"15e4bcb37faf21933be74d4a2a53c8d911842e1694e17c9ed4a7ca8bb0b02b83"}}