{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QXZKZQ3OC4CWCSB76GOMMNMOVF","short_pith_number":"pith:QXZKZQ3O","canonical_record":{"source":{"id":"1905.04612","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-12T00:01:07Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"629137c9f18d209f116bdc3692fb05cade7299ec2e830b97c74df81c786d5a63","abstract_canon_sha256":"80b9c517813eb84b22ccac973b7b1db76ff8d9e81b965c96eb77c2fa58d98dd4"},"schema_version":"1.0"},"canonical_sha256":"85f2acc36e170561483ff19cc6358ea964ec7a152d5368536170b9e980b667d8","source":{"kind":"arxiv","id":"1905.04612","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04612","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04612v1","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04612","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"QXZKZQ3OC4CW","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QXZKZQ3OC4CWCSB7","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QXZKZQ3O","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QXZKZQ3OC4CWCSB76GOMMNMOVF","target":"record","payload":{"canonical_record":{"source":{"id":"1905.04612","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-12T00:01:07Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"629137c9f18d209f116bdc3692fb05cade7299ec2e830b97c74df81c786d5a63","abstract_canon_sha256":"80b9c517813eb84b22ccac973b7b1db76ff8d9e81b965c96eb77c2fa58d98dd4"},"schema_version":"1.0"},"canonical_sha256":"85f2acc36e170561483ff19cc6358ea964ec7a152d5368536170b9e980b667d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:24.204604Z","signature_b64":"DnivP8u/owSerggvc97Ja/7e+fvJpm6TbzuhDiMvugroT5dAg8CusPp6lIPV4RIGnRPDw5NRr2scyfFjCZ5hAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85f2acc36e170561483ff19cc6358ea964ec7a152d5368536170b9e980b667d8","last_reissued_at":"2026-05-17T23:46:24.203990Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:24.203990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.04612","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-17T23:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jBTjkqqXkCXAuDQ/Ho1JjdXkGXuq659XT9/jVRn2KNwo2fggP2QK8J7BslWFeA+Xd/3ORgV2gOEnE+dm4SKQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:18:01.859620Z"},"content_sha256":"8a76c0aaf8923b5932dfe07b16fb57732ac22868bd88165d3ebf6e0d40301454","schema_version":"1.0","event_id":"sha256:8a76c0aaf8923b5932dfe07b16fb57732ac22868bd88165d3ebf6e0d40301454"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QXZKZQ3OC4CWCSB76GOMMNMOVF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Continuous-Time Systems for Solving 0-1 Integer Linear Programming Feasibility Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bruce J. MacLennan, Chengrui Li","submitted_at":"2019-05-12T00:01:07Z","abstract_excerpt":"The 0-1 integer linear programming feasibility problem is an important NP-complete problem. This paper proposes a continuous-time dynamical system for solving that problem without getting trapped in non-solution local minima. First, the problem is transformed to an easier form in linear time. Then, we propose an \"impulse algorithm\" to escape from local traps and show its performance is better than randomization for escaping traps. Second, we present the time-to-solution distribution of the impulse algorithm and compare it with exhaustive search to see its advantages. Third, we show that the fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04612","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-17T23:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ifIwKxytQJXDUiKGbOdlpu21xhz8VJGsEEnhQFp1ejOGaUzZ5fMebmDO2BBmX885sM3Cv75uM6yZNDyyybYJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:18:01.859961Z"},"content_sha256":"a3ed329d64aea76f878123e4b422ac572c2591fe2eebacefc1f555cc105bfb43","schema_version":"1.0","event_id":"sha256:a3ed329d64aea76f878123e4b422ac572c2591fe2eebacefc1f555cc105bfb43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXZKZQ3OC4CWCSB76GOMMNMOVF/bundle.json","state_url":"https://pith.science/pith/QXZKZQ3OC4CWCSB76GOMMNMOVF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXZKZQ3OC4CWCSB76GOMMNMOVF/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-29T08:18:01Z","links":{"resolver":"https://pith.science/pith/QXZKZQ3OC4CWCSB76GOMMNMOVF","bundle":"https://pith.science/pith/QXZKZQ3OC4CWCSB76GOMMNMOVF/bundle.json","state":"https://pith.science/pith/QXZKZQ3OC4CWCSB76GOMMNMOVF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXZKZQ3OC4CWCSB76GOMMNMOVF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QXZKZQ3OC4CWCSB76GOMMNMOVF","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":"80b9c517813eb84b22ccac973b7b1db76ff8d9e81b965c96eb77c2fa58d98dd4","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-12T00:01:07Z","title_canon_sha256":"629137c9f18d209f116bdc3692fb05cade7299ec2e830b97c74df81c786d5a63"},"schema_version":"1.0","source":{"id":"1905.04612","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04612","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04612v1","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04612","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"QXZKZQ3OC4CW","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QXZKZQ3OC4CWCSB7","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QXZKZQ3O","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:a3ed329d64aea76f878123e4b422ac572c2591fe2eebacefc1f555cc105bfb43","target":"graph","created_at":"2026-05-17T23:46:24Z","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 0-1 integer linear programming feasibility problem is an important NP-complete problem. This paper proposes a continuous-time dynamical system for solving that problem without getting trapped in non-solution local minima. First, the problem is transformed to an easier form in linear time. Then, we propose an \"impulse algorithm\" to escape from local traps and show its performance is better than randomization for escaping traps. Second, we present the time-to-solution distribution of the impulse algorithm and compare it with exhaustive search to see its advantages. Third, we show that the fr","authors_text":"Bruce J. MacLennan, Chengrui Li","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-12T00:01:07Z","title":"Continuous-Time Systems for Solving 0-1 Integer Linear Programming Feasibility Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04612","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:8a76c0aaf8923b5932dfe07b16fb57732ac22868bd88165d3ebf6e0d40301454","target":"record","created_at":"2026-05-17T23:46:24Z","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":"80b9c517813eb84b22ccac973b7b1db76ff8d9e81b965c96eb77c2fa58d98dd4","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-12T00:01:07Z","title_canon_sha256":"629137c9f18d209f116bdc3692fb05cade7299ec2e830b97c74df81c786d5a63"},"schema_version":"1.0","source":{"id":"1905.04612","kind":"arxiv","version":1}},"canonical_sha256":"85f2acc36e170561483ff19cc6358ea964ec7a152d5368536170b9e980b667d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85f2acc36e170561483ff19cc6358ea964ec7a152d5368536170b9e980b667d8","first_computed_at":"2026-05-17T23:46:24.203990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:24.203990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DnivP8u/owSerggvc97Ja/7e+fvJpm6TbzuhDiMvugroT5dAg8CusPp6lIPV4RIGnRPDw5NRr2scyfFjCZ5hAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:24.204604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04612","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a76c0aaf8923b5932dfe07b16fb57732ac22868bd88165d3ebf6e0d40301454","sha256:a3ed329d64aea76f878123e4b422ac572c2591fe2eebacefc1f555cc105bfb43"],"state_sha256":"40d52e24b63824c018c3f6635ab2c744ff3ef9202c793b27f53e114b1f85c1e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PLsZ5zNrf0XJOMMiErEitciQwvTE8rd2/9ttSj6pKkhdyZUDtgUqo3YZf1rJOOVF3/rgnZaXbzOpKNpZelMMAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T08:18:01.861751Z","bundle_sha256":"3ade16d2691d9091aafc42252805d33050d6240111413a4c5e590960f5d16fce"}}