{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IFCFYSIK7ACKA34O4G2KESWR6I","short_pith_number":"pith:IFCFYSIK","canonical_record":{"source":{"id":"1811.10665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-26T19:51:27Z","cross_cats_sorted":["cs.LG","cs.PL"],"title_canon_sha256":"3c8346659ff2424ea726c2d3a851eec4b422907a15360f8e7511773377d6ee9e","abstract_canon_sha256":"944f782e961016a15e3e9f04bc30f2365cb2cd92be841882cbac7fa7b46341b1"},"schema_version":"1.0"},"canonical_sha256":"41445c490af804a06f8ee1b4a24ad1f2039273681a54f4e391cc4011d82cc13e","source":{"kind":"arxiv","id":"1811.10665","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10665","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10665v1","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10665","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"IFCFYSIK7ACK","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IFCFYSIK7ACKA34O","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IFCFYSIK","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IFCFYSIK7ACKA34O4G2KESWR6I","target":"record","payload":{"canonical_record":{"source":{"id":"1811.10665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-26T19:51:27Z","cross_cats_sorted":["cs.LG","cs.PL"],"title_canon_sha256":"3c8346659ff2424ea726c2d3a851eec4b422907a15360f8e7511773377d6ee9e","abstract_canon_sha256":"944f782e961016a15e3e9f04bc30f2365cb2cd92be841882cbac7fa7b46341b1"},"schema_version":"1.0"},"canonical_sha256":"41445c490af804a06f8ee1b4a24ad1f2039273681a54f4e391cc4011d82cc13e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:47.876219Z","signature_b64":"rkD7ho/t6adYuj+E7RpVXKh8zqquWjwUtUuUUG0Ygzrcd//kcSHPtUu3TJ3tI2XLKyuzxV51Wh50uZs/rdorBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41445c490af804a06f8ee1b4a24ad1f2039273681a54f4e391cc4011d82cc13e","last_reissued_at":"2026-05-17T23:59:47.875731Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:47.875731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.10665","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:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mobeyBqHzcZwhmWFE5gCyC7/Q04NwwI06JCgfNRjKslGzRTKBkN35SYJ/4BKi/ZsZI0SUotKJ4JJzTH1I/mNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T01:20:04.261831Z"},"content_sha256":"cccb62482315cf9fb9740858f3763b8a86b5ba4f5f950009faa9d114049405dd","schema_version":"1.0","event_id":"sha256:cccb62482315cf9fb9740858f3763b8a86b5ba4f5f950009faa9d114049405dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IFCFYSIK7ACKA34O4G2KESWR6I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stepping Stones to Inductive Synthesis of Low-Level Looping Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.PL"],"primary_cat":"cs.AI","authors_text":"Christopher D. Rosin","submitted_at":"2018-11-26T19:51:27Z","abstract_excerpt":"Inductive program synthesis, from input/output examples, can provide an opportunity to automatically create programs from scratch without presupposing the algorithmic form of the solution. For induction of general programs with loops (as opposed to loop-free programs, or synthesis for domain-specific languages), the state of the art is at the level of introductory programming assignments. Most problems that require algorithmic subtlety, such as fast sorting, have remained out of reach without the benefit of significant problem-specific background knowledge. A key challenge is to identify cues "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10665","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:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V3u/EXzbaSrICCRaW1oxskwuCLh/ad793ftNF6bv2Iw/v2IrxSkvpg6qlHnZuXxqRbnAqK8M9UAZWcZ3AQ0pDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T01:20:04.262640Z"},"content_sha256":"7fe8cbdec4a4c968af3e1a6221a61c119c784aa1eaa7e29c43133a0faa2fcefd","schema_version":"1.0","event_id":"sha256:7fe8cbdec4a4c968af3e1a6221a61c119c784aa1eaa7e29c43133a0faa2fcefd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFCFYSIK7ACKA34O4G2KESWR6I/bundle.json","state_url":"https://pith.science/pith/IFCFYSIK7ACKA34O4G2KESWR6I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFCFYSIK7ACKA34O4G2KESWR6I/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-08-17T01:20:04Z","links":{"resolver":"https://pith.science/pith/IFCFYSIK7ACKA34O4G2KESWR6I","bundle":"https://pith.science/pith/IFCFYSIK7ACKA34O4G2KESWR6I/bundle.json","state":"https://pith.science/pith/IFCFYSIK7ACKA34O4G2KESWR6I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFCFYSIK7ACKA34O4G2KESWR6I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IFCFYSIK7ACKA34O4G2KESWR6I","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":"944f782e961016a15e3e9f04bc30f2365cb2cd92be841882cbac7fa7b46341b1","cross_cats_sorted":["cs.LG","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-26T19:51:27Z","title_canon_sha256":"3c8346659ff2424ea726c2d3a851eec4b422907a15360f8e7511773377d6ee9e"},"schema_version":"1.0","source":{"id":"1811.10665","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10665","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10665v1","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10665","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"IFCFYSIK7ACK","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IFCFYSIK7ACKA34O","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IFCFYSIK","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:7fe8cbdec4a4c968af3e1a6221a61c119c784aa1eaa7e29c43133a0faa2fcefd","target":"graph","created_at":"2026-05-17T23:59:47Z","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":"Inductive program synthesis, from input/output examples, can provide an opportunity to automatically create programs from scratch without presupposing the algorithmic form of the solution. For induction of general programs with loops (as opposed to loop-free programs, or synthesis for domain-specific languages), the state of the art is at the level of introductory programming assignments. Most problems that require algorithmic subtlety, such as fast sorting, have remained out of reach without the benefit of significant problem-specific background knowledge. A key challenge is to identify cues ","authors_text":"Christopher D. Rosin","cross_cats":["cs.LG","cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-26T19:51:27Z","title":"Stepping Stones to Inductive Synthesis of Low-Level Looping Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10665","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:cccb62482315cf9fb9740858f3763b8a86b5ba4f5f950009faa9d114049405dd","target":"record","created_at":"2026-05-17T23:59:47Z","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":"944f782e961016a15e3e9f04bc30f2365cb2cd92be841882cbac7fa7b46341b1","cross_cats_sorted":["cs.LG","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-26T19:51:27Z","title_canon_sha256":"3c8346659ff2424ea726c2d3a851eec4b422907a15360f8e7511773377d6ee9e"},"schema_version":"1.0","source":{"id":"1811.10665","kind":"arxiv","version":1}},"canonical_sha256":"41445c490af804a06f8ee1b4a24ad1f2039273681a54f4e391cc4011d82cc13e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41445c490af804a06f8ee1b4a24ad1f2039273681a54f4e391cc4011d82cc13e","first_computed_at":"2026-05-17T23:59:47.875731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:47.875731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rkD7ho/t6adYuj+E7RpVXKh8zqquWjwUtUuUUG0Ygzrcd//kcSHPtUu3TJ3tI2XLKyuzxV51Wh50uZs/rdorBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:47.876219Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10665","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cccb62482315cf9fb9740858f3763b8a86b5ba4f5f950009faa9d114049405dd","sha256:7fe8cbdec4a4c968af3e1a6221a61c119c784aa1eaa7e29c43133a0faa2fcefd"],"state_sha256":"756640bb21e1493f4cf5c0d1edbfab849f580cd74bbbad36d8f4ada0fc784952"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bq+vuvdk7Iv0ZijwdBRPvMK3eItX3QjpNf6Dkyrnbnvc3wk+Zu40KPJBRr+Jlm244AsTdGW38lSeRbl5bHmGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T01:20:04.268649Z","bundle_sha256":"ebe49581e9fa41bfe0ddafbbebeca29bcbece37a0c1ec0aa06a2fd74a2fe158b"}}