{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CGV2NFA74P6IMAJQRQQQKDGXIJ","short_pith_number":"pith:CGV2NFA7","canonical_record":{"source":{"id":"1202.0521","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-02T19:23:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e9cf202fa22ae9233fdfd514b73096d599061a2a5e9d9aa33d1d60ffcb215ba4","abstract_canon_sha256":"a44f48baa97376f108b024cb1769d340b1938610a265e963c493c482e77b0019"},"schema_version":"1.0"},"canonical_sha256":"11aba6941fe3fc8601308c21050cd742632dad312e0cc2efbbaee7660545f70e","source":{"kind":"arxiv","id":"1202.0521","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0521","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0521v2","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0521","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"CGV2NFA74P6I","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CGV2NFA74P6IMAJQ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CGV2NFA7","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CGV2NFA74P6IMAJQRQQQKDGXIJ","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0521","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-02T19:23:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e9cf202fa22ae9233fdfd514b73096d599061a2a5e9d9aa33d1d60ffcb215ba4","abstract_canon_sha256":"a44f48baa97376f108b024cb1769d340b1938610a265e963c493c482e77b0019"},"schema_version":"1.0"},"canonical_sha256":"11aba6941fe3fc8601308c21050cd742632dad312e0cc2efbbaee7660545f70e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:06.176472Z","signature_b64":"kWEuBatwubwm6xPbcy+z58q517Lbt7rw00oNMjwqz7w7KLufM7GgJvVv/EMEZFDhjXHQOm8VgXOAQqYNjIyVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11aba6941fe3fc8601308c21050cd742632dad312e0cc2efbbaee7660545f70e","last_reissued_at":"2026-05-18T04:03:06.175461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:06.175461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0521","source_version":2,"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-18T04:03:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CsZQQ0VBArjJrtPaRmfuAGCH/Z9WiTicEypVD1TFbeccIij8YbnPxF+dMNmjde+XOQcM2qF0f3RYRJYs9YstBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:51:48.148525Z"},"content_sha256":"2818cbf187ba92c27fdf52485c57e070aebc58aea6304be1461b454d52e50a15","schema_version":"1.0","event_id":"sha256:2818cbf187ba92c27fdf52485c57e070aebc58aea6304be1461b454d52e50a15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CGV2NFA74P6IMAJQRQQQKDGXIJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On ML-Certificate Linear Constraints for Rank Modulation with Linear Programming Decoding and its Application to Compact Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Manabu Hagiwara","submitted_at":"2012-02-02T19:23:08Z","abstract_excerpt":"Linear constraints for a matrix polytope with no fractional vertex are investigated as intersecting research among permutation codes, rank modulations, and linear programming methods. By focusing the discussion to the block structure of matrices, new classes of such polytopes are obtained from known small polytopes. This concept, called \"consolidation\", is applied to find a new compact graph which is known as an approach for the graph isomorphism problem. Encoding and decoding algorithms for our new permutation codes are obtained from existing algorithms for small polytopes. The minimum distan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0521","kind":"arxiv","version":2},"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-18T04:03:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j+rtFln68V3zVEy0VnDOqwd7WKO++VN2fV2/7n1xC+ab5BXvKHjJ01OevSxaPyJZ9rwoyOjCTBxWPPYHwb5zCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:51:48.148857Z"},"content_sha256":"21a1928aa79a47f9cf6e4e7bad0266718aa9ae95253c065559c94e54e541f68b","schema_version":"1.0","event_id":"sha256:21a1928aa79a47f9cf6e4e7bad0266718aa9ae95253c065559c94e54e541f68b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGV2NFA74P6IMAJQRQQQKDGXIJ/bundle.json","state_url":"https://pith.science/pith/CGV2NFA74P6IMAJQRQQQKDGXIJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGV2NFA74P6IMAJQRQQQKDGXIJ/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-08T23:51:48Z","links":{"resolver":"https://pith.science/pith/CGV2NFA74P6IMAJQRQQQKDGXIJ","bundle":"https://pith.science/pith/CGV2NFA74P6IMAJQRQQQKDGXIJ/bundle.json","state":"https://pith.science/pith/CGV2NFA74P6IMAJQRQQQKDGXIJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGV2NFA74P6IMAJQRQQQKDGXIJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CGV2NFA74P6IMAJQRQQQKDGXIJ","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":"a44f48baa97376f108b024cb1769d340b1938610a265e963c493c482e77b0019","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-02T19:23:08Z","title_canon_sha256":"e9cf202fa22ae9233fdfd514b73096d599061a2a5e9d9aa33d1d60ffcb215ba4"},"schema_version":"1.0","source":{"id":"1202.0521","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0521","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0521v2","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0521","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"CGV2NFA74P6I","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CGV2NFA74P6IMAJQ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CGV2NFA7","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:21a1928aa79a47f9cf6e4e7bad0266718aa9ae95253c065559c94e54e541f68b","target":"graph","created_at":"2026-05-18T04:03:06Z","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":"Linear constraints for a matrix polytope with no fractional vertex are investigated as intersecting research among permutation codes, rank modulations, and linear programming methods. By focusing the discussion to the block structure of matrices, new classes of such polytopes are obtained from known small polytopes. This concept, called \"consolidation\", is applied to find a new compact graph which is known as an approach for the graph isomorphism problem. Encoding and decoding algorithms for our new permutation codes are obtained from existing algorithms for small polytopes. The minimum distan","authors_text":"Manabu Hagiwara","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-02T19:23:08Z","title":"On ML-Certificate Linear Constraints for Rank Modulation with Linear Programming Decoding and its Application to Compact Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0521","kind":"arxiv","version":2},"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:2818cbf187ba92c27fdf52485c57e070aebc58aea6304be1461b454d52e50a15","target":"record","created_at":"2026-05-18T04:03:06Z","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":"a44f48baa97376f108b024cb1769d340b1938610a265e963c493c482e77b0019","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-02T19:23:08Z","title_canon_sha256":"e9cf202fa22ae9233fdfd514b73096d599061a2a5e9d9aa33d1d60ffcb215ba4"},"schema_version":"1.0","source":{"id":"1202.0521","kind":"arxiv","version":2}},"canonical_sha256":"11aba6941fe3fc8601308c21050cd742632dad312e0cc2efbbaee7660545f70e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11aba6941fe3fc8601308c21050cd742632dad312e0cc2efbbaee7660545f70e","first_computed_at":"2026-05-18T04:03:06.175461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:06.175461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kWEuBatwubwm6xPbcy+z58q517Lbt7rw00oNMjwqz7w7KLufM7GgJvVv/EMEZFDhjXHQOm8VgXOAQqYNjIyVCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:06.176472Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0521","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2818cbf187ba92c27fdf52485c57e070aebc58aea6304be1461b454d52e50a15","sha256:21a1928aa79a47f9cf6e4e7bad0266718aa9ae95253c065559c94e54e541f68b"],"state_sha256":"45543278ac8c40b8d86704b73a93bfd569d3530218c75ca05c5debfa3ccd95ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YWYQtkrbUwNjFaIEURq7Nq8LSKujFEoItdNblfcbXcQKvhTDdwZW/TW6s9cRBdxcWrCUlooxZCHbu3V3xyi8Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:51:48.150688Z","bundle_sha256":"474d36612bb8f105d10d0822cb304ac3e27a39dd2066123d5c02e8cd078e0069"}}