{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WAIXUTGTO7TAQY7UVWG2KVQZXM","short_pith_number":"pith:WAIXUTGT","canonical_record":{"source":{"id":"1511.00310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-01T21:47:44Z","cross_cats_sorted":[],"title_canon_sha256":"17121ea3a191093889aab400d874147c37a084f56324f52b68612af75ac5d266","abstract_canon_sha256":"5294bb260c99557d3bd92a0fc6ff038e5c7c876230813b17602e01cd111750d9"},"schema_version":"1.0"},"canonical_sha256":"b0117a4cd377e60863f4ad8da55619bb01a7aaa8a93249996be4d1a52acf932b","source":{"kind":"arxiv","id":"1511.00310","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.00310","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"arxiv_version","alias_value":"1511.00310v2","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00310","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"pith_short_12","alias_value":"WAIXUTGTO7TA","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WAIXUTGTO7TAQY7U","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WAIXUTGT","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WAIXUTGTO7TAQY7UVWG2KVQZXM","target":"record","payload":{"canonical_record":{"source":{"id":"1511.00310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-01T21:47:44Z","cross_cats_sorted":[],"title_canon_sha256":"17121ea3a191093889aab400d874147c37a084f56324f52b68612af75ac5d266","abstract_canon_sha256":"5294bb260c99557d3bd92a0fc6ff038e5c7c876230813b17602e01cd111750d9"},"schema_version":"1.0"},"canonical_sha256":"b0117a4cd377e60863f4ad8da55619bb01a7aaa8a93249996be4d1a52acf932b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:49.657785Z","signature_b64":"rZYcY8Je42ifZE4eydb9STrJXX8+AQbAvytVAmtS7qzdPxfDNB8c7FvSTnChKfxWxIWZErwL+do2lVx+ADFyDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0117a4cd377e60863f4ad8da55619bb01a7aaa8a93249996be4d1a52acf932b","last_reissued_at":"2026-05-18T00:46:49.657118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:49.657118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.00310","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-18T00:46:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MtVXTUmQYxtiqCeQqcrnKtS+sF2gQeLIx11DBUp7jdVJcvaKeOtNJo93Ijx44gFY63sTkzWuCT2IK+H52UwFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:04:20.234939Z"},"content_sha256":"f0e74cb32948187410457e1e0d61b3f4d3afa970e2683527b20a42867ea74a16","schema_version":"1.0","event_id":"sha256:f0e74cb32948187410457e1e0d61b3f4d3afa970e2683527b20a42867ea74a16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WAIXUTGTO7TAQY7UVWG2KVQZXM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Integer Quadratic Programming: Variables and Coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov","submitted_at":"2015-11-01T21:47:44Z","abstract_excerpt":"In the Integer Quadratic Programming problem input is an n*n integer matrix Q, an m*n integer matrix A and an m-dimensional integer vector b. The task is to find a vector x in Z^n, minimizing x^TQx, subject to Ax <= b. We give a fixed parameter tractable algorithm for Integer Quadratic Programming parameterized by n+a. Here a is the largest absolute value of an entry of Q and A. As an application of our main result we show that Optimal Linear Arrangement is fixed parameter tractable parameterized by the size of the smallest vertex cover of the input graph. This resolves an open problem from th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00310","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-18T00:46:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gBuxxLSn7ZQB7w5c98d/lGT1Avi3d/Avqzh/Orp0U7YBSLmLRymtXqZrUKFxe7PaOdymQJvJT5EH9vkBqRaBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:04:20.235354Z"},"content_sha256":"287fd045c60c053b82c3bccfcb7f09f733692b15e8b5a6370207f1b2436a92df","schema_version":"1.0","event_id":"sha256:287fd045c60c053b82c3bccfcb7f09f733692b15e8b5a6370207f1b2436a92df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WAIXUTGTO7TAQY7UVWG2KVQZXM/bundle.json","state_url":"https://pith.science/pith/WAIXUTGTO7TAQY7UVWG2KVQZXM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WAIXUTGTO7TAQY7UVWG2KVQZXM/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-26T16:04:20Z","links":{"resolver":"https://pith.science/pith/WAIXUTGTO7TAQY7UVWG2KVQZXM","bundle":"https://pith.science/pith/WAIXUTGTO7TAQY7UVWG2KVQZXM/bundle.json","state":"https://pith.science/pith/WAIXUTGTO7TAQY7UVWG2KVQZXM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WAIXUTGTO7TAQY7UVWG2KVQZXM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WAIXUTGTO7TAQY7UVWG2KVQZXM","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":"5294bb260c99557d3bd92a0fc6ff038e5c7c876230813b17602e01cd111750d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-01T21:47:44Z","title_canon_sha256":"17121ea3a191093889aab400d874147c37a084f56324f52b68612af75ac5d266"},"schema_version":"1.0","source":{"id":"1511.00310","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.00310","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"arxiv_version","alias_value":"1511.00310v2","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00310","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"pith_short_12","alias_value":"WAIXUTGTO7TA","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WAIXUTGTO7TAQY7U","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WAIXUTGT","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:287fd045c60c053b82c3bccfcb7f09f733692b15e8b5a6370207f1b2436a92df","target":"graph","created_at":"2026-05-18T00:46:49Z","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":"In the Integer Quadratic Programming problem input is an n*n integer matrix Q, an m*n integer matrix A and an m-dimensional integer vector b. The task is to find a vector x in Z^n, minimizing x^TQx, subject to Ax <= b. We give a fixed parameter tractable algorithm for Integer Quadratic Programming parameterized by n+a. Here a is the largest absolute value of an entry of Q and A. As an application of our main result we show that Optimal Linear Arrangement is fixed parameter tractable parameterized by the size of the smallest vertex cover of the input graph. This resolves an open problem from th","authors_text":"Daniel Lokshtanov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-01T21:47:44Z","title":"Parameterized Integer Quadratic Programming: Variables and Coefficients"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00310","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:f0e74cb32948187410457e1e0d61b3f4d3afa970e2683527b20a42867ea74a16","target":"record","created_at":"2026-05-18T00:46:49Z","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":"5294bb260c99557d3bd92a0fc6ff038e5c7c876230813b17602e01cd111750d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-01T21:47:44Z","title_canon_sha256":"17121ea3a191093889aab400d874147c37a084f56324f52b68612af75ac5d266"},"schema_version":"1.0","source":{"id":"1511.00310","kind":"arxiv","version":2}},"canonical_sha256":"b0117a4cd377e60863f4ad8da55619bb01a7aaa8a93249996be4d1a52acf932b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0117a4cd377e60863f4ad8da55619bb01a7aaa8a93249996be4d1a52acf932b","first_computed_at":"2026-05-18T00:46:49.657118Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:49.657118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rZYcY8Je42ifZE4eydb9STrJXX8+AQbAvytVAmtS7qzdPxfDNB8c7FvSTnChKfxWxIWZErwL+do2lVx+ADFyDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:49.657785Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.00310","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0e74cb32948187410457e1e0d61b3f4d3afa970e2683527b20a42867ea74a16","sha256:287fd045c60c053b82c3bccfcb7f09f733692b15e8b5a6370207f1b2436a92df"],"state_sha256":"70ecc5b600c34c27d2c2eebb747ea8a2edddf6a0c591b24a5b818dd05c33bc0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KjKfS8fyOJzJvX59n+LjdtDToOFYXltS0mBdyAcrzH6DBQatERY9cj53QMsZ9kusE3e+UorDhtZnssJxX8l9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:04:20.237810Z","bundle_sha256":"86f49e66defe06b4616636c1af5ffb86ec914725895b063def5852e5583233fb"}}