{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DU7YS6NCO4YB2OAEQQAEG4KSOS","short_pith_number":"pith:DU7YS6NC","canonical_record":{"source":{"id":"1412.2304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-12-07T02:24:21Z","cross_cats_sorted":[],"title_canon_sha256":"1cefc53122a2cb8dd015cdc9fc47a71f06da4cb6bf3ea1854c11f7b4f32d9ac8","abstract_canon_sha256":"c8c6a2f873c3938e1a8ed1b3650dc813c8a2dbb9bbfa87631273efc329341934"},"schema_version":"1.0"},"canonical_sha256":"1d3f8979a277301d38048400437152748713162e2e6803b0945ce1340796929e","source":{"kind":"arxiv","id":"1412.2304","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2304","created_at":"2026-05-18T02:31:20Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2304v2","created_at":"2026-05-18T02:31:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2304","created_at":"2026-05-18T02:31:20Z"},{"alias_kind":"pith_short_12","alias_value":"DU7YS6NCO4YB","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DU7YS6NCO4YB2OAE","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DU7YS6NC","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DU7YS6NCO4YB2OAEQQAEG4KSOS","target":"record","payload":{"canonical_record":{"source":{"id":"1412.2304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-12-07T02:24:21Z","cross_cats_sorted":[],"title_canon_sha256":"1cefc53122a2cb8dd015cdc9fc47a71f06da4cb6bf3ea1854c11f7b4f32d9ac8","abstract_canon_sha256":"c8c6a2f873c3938e1a8ed1b3650dc813c8a2dbb9bbfa87631273efc329341934"},"schema_version":"1.0"},"canonical_sha256":"1d3f8979a277301d38048400437152748713162e2e6803b0945ce1340796929e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:20.263304Z","signature_b64":"Qr+cQ2+oP3gLUy2vIIBsQe8nH2iff1bWer+RF7T3+PessVn33weT4UqFZ0ibXnFBptyko46AsNBHAgJ+MnhgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d3f8979a277301d38048400437152748713162e2e6803b0945ce1340796929e","last_reissued_at":"2026-05-18T02:31:20.262601Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:20.262601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.2304","source_version":2,"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-18T02:31:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2KIA5Hb+7cxWPVcDZ+Mw6MKyIbDlLRmgq527CtR4hnd3oR8MB0e4XIEuyv4k/CAru964JU1FbukQMWSnthqDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T14:38:12.040333Z"},"content_sha256":"3462f4582870d79cbca383f84990b941f2351ba08d11bbc25aefef68156c2483","schema_version":"1.0","event_id":"sha256:3462f4582870d79cbca383f84990b941f2351ba08d11bbc25aefef68156c2483"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DU7YS6NCO4YB2OAEQQAEG4KSOS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Declaratively solving tricky Google Code Jam problems with Prolog-based ECLiPSe CLP system","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Mariia Mykhailova, Sergii Dymchenko","submitted_at":"2014-12-07T02:24:21Z","abstract_excerpt":"In this paper we demonstrate several examples of solving challenging algorithmic problems from the Google Code Jam programming contest with the Prolog-based ECLiPSe system using declarative techniques like constraint logic programming and linear (integer) programming. These problems were designed to be solved by inventing clever algorithms and efficiently implementing them in a conventional imperative programming language, but we present relatively simple declarative programs in ECLiPSe that are fast enough to find answers within the time limit imposed by the contest rules. We claim that decla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2304","kind":"arxiv","version":2},"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-18T02:31:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QccTxAMUga+w+CueVOAuVbL9HoI/QGTz9KIZs7mN6SntlpSNOgsnWwrTXLbhyZfiyDYxcLMcCBLlvgLlwl3/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T14:38:12.040670Z"},"content_sha256":"0757056e9c92b80adb07b4d956aa65360cb9f40f1b9b194c3341a9a131af4c45","schema_version":"1.0","event_id":"sha256:0757056e9c92b80adb07b4d956aa65360cb9f40f1b9b194c3341a9a131af4c45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DU7YS6NCO4YB2OAEQQAEG4KSOS/bundle.json","state_url":"https://pith.science/pith/DU7YS6NCO4YB2OAEQQAEG4KSOS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DU7YS6NCO4YB2OAEQQAEG4KSOS/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-29T14:38:12Z","links":{"resolver":"https://pith.science/pith/DU7YS6NCO4YB2OAEQQAEG4KSOS","bundle":"https://pith.science/pith/DU7YS6NCO4YB2OAEQQAEG4KSOS/bundle.json","state":"https://pith.science/pith/DU7YS6NCO4YB2OAEQQAEG4KSOS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DU7YS6NCO4YB2OAEQQAEG4KSOS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DU7YS6NCO4YB2OAEQQAEG4KSOS","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":"c8c6a2f873c3938e1a8ed1b3650dc813c8a2dbb9bbfa87631273efc329341934","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-12-07T02:24:21Z","title_canon_sha256":"1cefc53122a2cb8dd015cdc9fc47a71f06da4cb6bf3ea1854c11f7b4f32d9ac8"},"schema_version":"1.0","source":{"id":"1412.2304","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2304","created_at":"2026-05-18T02:31:20Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2304v2","created_at":"2026-05-18T02:31:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2304","created_at":"2026-05-18T02:31:20Z"},{"alias_kind":"pith_short_12","alias_value":"DU7YS6NCO4YB","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DU7YS6NCO4YB2OAE","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DU7YS6NC","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:0757056e9c92b80adb07b4d956aa65360cb9f40f1b9b194c3341a9a131af4c45","target":"graph","created_at":"2026-05-18T02:31:20Z","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":"In this paper we demonstrate several examples of solving challenging algorithmic problems from the Google Code Jam programming contest with the Prolog-based ECLiPSe system using declarative techniques like constraint logic programming and linear (integer) programming. These problems were designed to be solved by inventing clever algorithms and efficiently implementing them in a conventional imperative programming language, but we present relatively simple declarative programs in ECLiPSe that are fast enough to find answers within the time limit imposed by the contest rules. We claim that decla","authors_text":"Mariia Mykhailova, Sergii Dymchenko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-12-07T02:24:21Z","title":"Declaratively solving tricky Google Code Jam problems with Prolog-based ECLiPSe CLP system"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2304","kind":"arxiv","version":2},"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:3462f4582870d79cbca383f84990b941f2351ba08d11bbc25aefef68156c2483","target":"record","created_at":"2026-05-18T02:31:20Z","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":"c8c6a2f873c3938e1a8ed1b3650dc813c8a2dbb9bbfa87631273efc329341934","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-12-07T02:24:21Z","title_canon_sha256":"1cefc53122a2cb8dd015cdc9fc47a71f06da4cb6bf3ea1854c11f7b4f32d9ac8"},"schema_version":"1.0","source":{"id":"1412.2304","kind":"arxiv","version":2}},"canonical_sha256":"1d3f8979a277301d38048400437152748713162e2e6803b0945ce1340796929e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d3f8979a277301d38048400437152748713162e2e6803b0945ce1340796929e","first_computed_at":"2026-05-18T02:31:20.262601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:20.262601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qr+cQ2+oP3gLUy2vIIBsQe8nH2iff1bWer+RF7T3+PessVn33weT4UqFZ0ibXnFBptyko46AsNBHAgJ+MnhgBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:20.263304Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2304","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3462f4582870d79cbca383f84990b941f2351ba08d11bbc25aefef68156c2483","sha256:0757056e9c92b80adb07b4d956aa65360cb9f40f1b9b194c3341a9a131af4c45"],"state_sha256":"683e9d0c901b0c6e0872d284e388f06a3592de789200d773d101c898ffdab0b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"khrMYabfBhd3H5d0dVvfdqf/UcXdExvGrw+jyIOBQ3mBvQvbHUDG84ZHTZayxJUhWEQ0jjvwKDSLRZyeir5bAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T14:38:12.042552Z","bundle_sha256":"0786afdf28ce81255a8aedc8b8b5b48db972f8d5f15eef31e79ee55adcb03800"}}