{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:N2BGSVXASOUCPUNXXAKFIHP3TW","short_pith_number":"pith:N2BGSVXA","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"},"canonical_sha256":"6e826956e093a827d1b7b814541dfb9db68c56759b6d9d314e625d7de47918a2","source":{"kind":"arxiv","id":"1702.07103","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07103","created_at":"2026-05-18T00:50:08Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07103v1","created_at":"2026-05-18T00:50:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07103","created_at":"2026-05-18T00:50:08Z"},{"alias_kind":"pith_short_12","alias_value":"N2BGSVXASOUC","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N2BGSVXASOUCPUNX","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N2BGSVXA","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:N2BGSVXASOUCPUNXXAKFIHP3TW","target":"record","payload":{"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"},"canonical_sha256":"6e826956e093a827d1b7b814541dfb9db68c56759b6d9d314e625d7de47918a2","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"},"source_kind":"arxiv","source_id":"1702.07103","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-18T00:50:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CWtJ6aA0izwH3OmV0Aulyl07ZZHRrZzKrTGlA8F54d5z1I0wXu+NUWKQ538VY2pSc76wifnKwkyEl5TQe1D1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:48:48.784810Z"},"content_sha256":"3f8e31618849701fe4515b57de2c6ff398cafcfecf93243de589b1d678f62630","schema_version":"1.0","event_id":"sha256:3f8e31618849701fe4515b57de2c6ff398cafcfecf93243de589b1d678f62630"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:N2BGSVXASOUCPUNXXAKFIHP3TW","target":"graph","payload":{"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"},"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:50:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3XBGypJ+0j3aj3T75X2esU0+D07Ky9BOOGxvfd3ZV18XPhJTMyueqbZUxnqn9zhyZ1OtHmZtK9EDRwKPPmx4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:48:48.785514Z"},"content_sha256":"829f01e5f8dbd4a225ea18e7ccb33200acb2d12acca55032bbaebdfb8105158a","schema_version":"1.0","event_id":"sha256:829f01e5f8dbd4a225ea18e7ccb33200acb2d12acca55032bbaebdfb8105158a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N2BGSVXASOUCPUNXXAKFIHP3TW/bundle.json","state_url":"https://pith.science/pith/N2BGSVXASOUCPUNXXAKFIHP3TW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N2BGSVXASOUCPUNXXAKFIHP3TW/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-26T08:48:48Z","links":{"resolver":"https://pith.science/pith/N2BGSVXASOUCPUNXXAKFIHP3TW","bundle":"https://pith.science/pith/N2BGSVXASOUCPUNXXAKFIHP3TW/bundle.json","state":"https://pith.science/pith/N2BGSVXASOUCPUNXXAKFIHP3TW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N2BGSVXASOUCPUNXXAKFIHP3TW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:N2BGSVXASOUCPUNXXAKFIHP3TW","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":"22e33246940b287b2622203504ec561d43f17c0d06154096a199a57e5b173bf3","cross_cats_sorted":["cs.CR","cs.FL","cs.LG","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-02-23T05:48:22Z","title_canon_sha256":"d2f84ce5cda4c376ffa3f7d6fcd96f8c8d715137b365bb0af1789a7b1e9df01a"},"schema_version":"1.0","source":{"id":"1702.07103","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07103","created_at":"2026-05-18T00:50:08Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07103v1","created_at":"2026-05-18T00:50:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07103","created_at":"2026-05-18T00:50:08Z"},{"alias_kind":"pith_short_12","alias_value":"N2BGSVXASOUC","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N2BGSVXASOUCPUNX","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N2BGSVXA","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:829f01e5f8dbd4a225ea18e7ccb33200acb2d12acca55032bbaebdfb8105158a","target":"graph","created_at":"2026-05-18T00:50:08Z","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":"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","authors_text":"Ashutosh Trivedi, Bor-Yuh Evan Chang, Pavol Cerny, Saeid Tizpaz-Niari, Sriram Sankaranarayanan","cross_cats":["cs.CR","cs.FL","cs.LG","cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-02-23T05:48:22Z","title":"Discriminating Traces with Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07103","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:3f8e31618849701fe4515b57de2c6ff398cafcfecf93243de589b1d678f62630","target":"record","created_at":"2026-05-18T00:50:08Z","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":"22e33246940b287b2622203504ec561d43f17c0d06154096a199a57e5b173bf3","cross_cats_sorted":["cs.CR","cs.FL","cs.LG","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-02-23T05:48:22Z","title_canon_sha256":"d2f84ce5cda4c376ffa3f7d6fcd96f8c8d715137b365bb0af1789a7b1e9df01a"},"schema_version":"1.0","source":{"id":"1702.07103","kind":"arxiv","version":1}},"canonical_sha256":"6e826956e093a827d1b7b814541dfb9db68c56759b6d9d314e625d7de47918a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e826956e093a827d1b7b814541dfb9db68c56759b6d9d314e625d7de47918a2","first_computed_at":"2026-05-18T00:50:08.308746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:08.308746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GE0MnplF6cN/SsdszcGKgFUc8yuVIUX2TBuDD2eLWQ87dVTku/yhEyBytZOKAj4kBO6ichJ9j0don8vFPO1oDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:08.309532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07103","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f8e31618849701fe4515b57de2c6ff398cafcfecf93243de589b1d678f62630","sha256:829f01e5f8dbd4a225ea18e7ccb33200acb2d12acca55032bbaebdfb8105158a"],"state_sha256":"f08b78f98ade93c6937460f7170c85591eb4d7eb8641c11bf3fcc4cde8cfd94e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KBdOZ4XoP05I/vFLXbtOJprMVgMOMy1tBfC7Zfjbc4MuxBxQcZ93GrzXDuQmsE6LYeUqC3GgmlBgxbqdZKFSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:48:48.789088Z","bundle_sha256":"ef53482dca5a06ce97cd1ab565d0675fc0c8e1ea74dbe2b9a6625c2215089ab3"}}