{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:R5NAPKH2B6QX6QYNPN3C4WLLEX","short_pith_number":"pith:R5NAPKH2","schema_version":"1.0","canonical_sha256":"8f5a07a8fa0fa17f430d7b762e596b25f73e89412a6d90acf313a0e97d9cf93d","source":{"kind":"arxiv","id":"2605.17158","version":1},"attestation_state":"computed","paper":{"title":"A comprehensive study on ILP acceleration accounting for sparsity, area, energy, data movement using near-memory architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Jaydeep P. Kulkarni, Lizy K John, Siddhartha Raman Sundara Raman","submitted_at":"2026-05-16T21:15:21Z","abstract_excerpt":"Integer Linear Programming (ILP) is widely used for solving real-world optimization problems, including network routing, map routing, and traffic scheduling. However, ILP algorithms are sparse and branch-intensive, making them inefficient on conventional CPUs and GPUs. Prior work has shown that large-scale ILP problems can require tens of hours of execution time even on massively parallel systems, limiting their applicability to time-sensitive decision-making workloads. Existing ILP solvers such as Gurobi employ software-level optimizations to handle sparsity on CPUs, but still face throughput"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.17158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2026-05-16T21:15:21Z","cross_cats_sorted":[],"title_canon_sha256":"a9f7f5e364dda9a54e8a3db1056617b9535a22dcd202a0471a7e5bca51e5012f","abstract_canon_sha256":"19fc609b10bd2ed975daaf02df64801a85cd8da758d9a69a7e2663e6efba7dae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:42.580986Z","signature_b64":"t/+L6s1YBjp9tgQOXei9+OmO2PU+XITWGagOgYz6VVSzG94bV11U6tWSOf+h3ts/ACIgzLddC8UQUG+/+D0OAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f5a07a8fa0fa17f430d7b762e596b25f73e89412a6d90acf313a0e97d9cf93d","last_reissued_at":"2026-05-20T00:03:42.580142Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:42.580142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A comprehensive study on ILP acceleration accounting for sparsity, area, energy, data movement using near-memory architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Jaydeep P. Kulkarni, Lizy K John, Siddhartha Raman Sundara Raman","submitted_at":"2026-05-16T21:15:21Z","abstract_excerpt":"Integer Linear Programming (ILP) is widely used for solving real-world optimization problems, including network routing, map routing, and traffic scheduling. However, ILP algorithms are sparse and branch-intensive, making them inefficient on conventional CPUs and GPUs. Prior work has shown that large-scale ILP problems can require tens of hours of execution time even on massively parallel systems, limiting their applicability to time-sensitive decision-making workloads. Existing ILP solvers such as Gurobi employ software-level optimizations to handle sparsity on CPUs, but still face throughput"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.17158","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17158/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T22:33:23.761218Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T22:01:57.991333Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"75eacc6709694b114f1b7e5fdc930b2ced44549d9b840e4e85f25fe19d650031"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.17158","created_at":"2026-05-20T00:03:42.580272+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.17158v1","created_at":"2026-05-20T00:03:42.580272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17158","created_at":"2026-05-20T00:03:42.580272+00:00"},{"alias_kind":"pith_short_12","alias_value":"R5NAPKH2B6QX","created_at":"2026-05-20T00:03:42.580272+00:00"},{"alias_kind":"pith_short_16","alias_value":"R5NAPKH2B6QX6QYN","created_at":"2026-05-20T00:03:42.580272+00:00"},{"alias_kind":"pith_short_8","alias_value":"R5NAPKH2","created_at":"2026-05-20T00:03:42.580272+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19405","citing_title":"A complete discussion on fully reconfigurable, digital, scalable, graph and sparsity-aware near-memory accelerator for graph neural networks","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R5NAPKH2B6QX6QYNPN3C4WLLEX","json":"https://pith.science/pith/R5NAPKH2B6QX6QYNPN3C4WLLEX.json","graph_json":"https://pith.science/api/pith-number/R5NAPKH2B6QX6QYNPN3C4WLLEX/graph.json","events_json":"https://pith.science/api/pith-number/R5NAPKH2B6QX6QYNPN3C4WLLEX/events.json","paper":"https://pith.science/paper/R5NAPKH2"},"agent_actions":{"view_html":"https://pith.science/pith/R5NAPKH2B6QX6QYNPN3C4WLLEX","download_json":"https://pith.science/pith/R5NAPKH2B6QX6QYNPN3C4WLLEX.json","view_paper":"https://pith.science/paper/R5NAPKH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.17158&json=true","fetch_graph":"https://pith.science/api/pith-number/R5NAPKH2B6QX6QYNPN3C4WLLEX/graph.json","fetch_events":"https://pith.science/api/pith-number/R5NAPKH2B6QX6QYNPN3C4WLLEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R5NAPKH2B6QX6QYNPN3C4WLLEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R5NAPKH2B6QX6QYNPN3C4WLLEX/action/storage_attestation","attest_author":"https://pith.science/pith/R5NAPKH2B6QX6QYNPN3C4WLLEX/action/author_attestation","sign_citation":"https://pith.science/pith/R5NAPKH2B6QX6QYNPN3C4WLLEX/action/citation_signature","submit_replication":"https://pith.science/pith/R5NAPKH2B6QX6QYNPN3C4WLLEX/action/replication_record"}},"created_at":"2026-05-20T00:03:42.580272+00:00","updated_at":"2026-05-20T00:03:42.580272+00:00"}