{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:N2BGSVXASOUCPUNXXAKFIHP3TW","short_pith_number":"pith:N2BGSVXA","schema_version":"1.0","canonical_sha256":"6e826956e093a827d1b7b814541dfb9db68c56759b6d9d314e625d7de47918a2","source":{"kind":"arxiv","id":"1702.07103","version":1},"attestation_state":"computed","paper":{"title":"Discriminating Traces with Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.FL","cs.LG","cs.SE"],"primary_cat":"cs.PL","authors_text":"Ashutosh Trivedi, Bor-Yuh Evan Chang, Pavol Cerny, Saeid Tizpaz-Niari, Sriram Sankaranarayanan","submitted_at":"2017-02-23T05:48:22Z","abstract_excerpt":"What properties about the internals of a program explain the possible differences in its overall running time for different inputs? In this paper, we propose a formal framework for considering this question we dub trace-set discrimination. We show that even though the algorithmic problem of computing maximum likelihood discriminants is NP-hard, approaches based on integer linear programming (ILP) and decision tree learning can be useful in zeroing-in on the program internals. On a set of Java benchmarks, we find that compactly-represented decision trees scalably discriminate with high accuracy"},"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":"1702.07103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-02-23T05:48:22Z","cross_cats_sorted":["cs.CR","cs.FL","cs.LG","cs.SE"],"title_canon_sha256":"d2f84ce5cda4c376ffa3f7d6fcd96f8c8d715137b365bb0af1789a7b1e9df01a","abstract_canon_sha256":"22e33246940b287b2622203504ec561d43f17c0d06154096a199a57e5b173bf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:08.309532Z","signature_b64":"GE0MnplF6cN/SsdszcGKgFUc8yuVIUX2TBuDD2eLWQ87dVTku/yhEyBytZOKAj4kBO6ichJ9j0don8vFPO1oDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e826956e093a827d1b7b814541dfb9db68c56759b6d9d314e625d7de47918a2","last_reissued_at":"2026-05-18T00:50:08.308746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:08.308746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discriminating Traces with Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.FL","cs.LG","cs.SE"],"primary_cat":"cs.PL","authors_text":"Ashutosh Trivedi, Bor-Yuh Evan Chang, Pavol Cerny, Saeid Tizpaz-Niari, Sriram Sankaranarayanan","submitted_at":"2017-02-23T05:48:22Z","abstract_excerpt":"What properties about the internals of a program explain the possible differences in its overall running time for different inputs? In this paper, we propose a formal framework for considering this question we dub trace-set discrimination. We show that even though the algorithmic problem of computing maximum likelihood discriminants is NP-hard, approaches based on integer linear programming (ILP) and decision tree learning can be useful in zeroing-in on the program internals. On a set of Java benchmarks, we find that compactly-represented decision trees scalably discriminate with high accuracy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07103","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.07103","created_at":"2026-05-18T00:50:08.308872+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.07103v1","created_at":"2026-05-18T00:50:08.308872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07103","created_at":"2026-05-18T00:50:08.308872+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2BGSVXASOUC","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2BGSVXASOUCPUNX","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2BGSVXA","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N2BGSVXASOUCPUNXXAKFIHP3TW","json":"https://pith.science/pith/N2BGSVXASOUCPUNXXAKFIHP3TW.json","graph_json":"https://pith.science/api/pith-number/N2BGSVXASOUCPUNXXAKFIHP3TW/graph.json","events_json":"https://pith.science/api/pith-number/N2BGSVXASOUCPUNXXAKFIHP3TW/events.json","paper":"https://pith.science/paper/N2BGSVXA"},"agent_actions":{"view_html":"https://pith.science/pith/N2BGSVXASOUCPUNXXAKFIHP3TW","download_json":"https://pith.science/pith/N2BGSVXASOUCPUNXXAKFIHP3TW.json","view_paper":"https://pith.science/paper/N2BGSVXA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.07103&json=true","fetch_graph":"https://pith.science/api/pith-number/N2BGSVXASOUCPUNXXAKFIHP3TW/graph.json","fetch_events":"https://pith.science/api/pith-number/N2BGSVXASOUCPUNXXAKFIHP3TW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2BGSVXASOUCPUNXXAKFIHP3TW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2BGSVXASOUCPUNXXAKFIHP3TW/action/storage_attestation","attest_author":"https://pith.science/pith/N2BGSVXASOUCPUNXXAKFIHP3TW/action/author_attestation","sign_citation":"https://pith.science/pith/N2BGSVXASOUCPUNXXAKFIHP3TW/action/citation_signature","submit_replication":"https://pith.science/pith/N2BGSVXASOUCPUNXXAKFIHP3TW/action/replication_record"}},"created_at":"2026-05-18T00:50:08.308872+00:00","updated_at":"2026-05-18T00:50:08.308872+00:00"}