{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HFTPECGDSECAODKVLACP4FN2TQ","short_pith_number":"pith:HFTPECGD","canonical_record":{"source":{"id":"1203.2809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-03-11T19:36:46Z","cross_cats_sorted":[],"title_canon_sha256":"bb4ac7d740e6d7118cb94b64b91762010fa4747cfc61a2468324f976b6d6991e","abstract_canon_sha256":"51825e06c5f829065c515d51ff0d7d9304b0ce4c00c83e57c0b45e8c2acfd670"},"schema_version":"1.0"},"canonical_sha256":"3966f208c39104070d555804fe15ba9c37f4f51bddf40a166a8ec431b7e8ef5b","source":{"kind":"arxiv","id":"1203.2809","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2809","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2809v1","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2809","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"HFTPECGDSECA","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HFTPECGDSECAODKV","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HFTPECGD","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HFTPECGDSECAODKVLACP4FN2TQ","target":"record","payload":{"canonical_record":{"source":{"id":"1203.2809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-03-11T19:36:46Z","cross_cats_sorted":[],"title_canon_sha256":"bb4ac7d740e6d7118cb94b64b91762010fa4747cfc61a2468324f976b6d6991e","abstract_canon_sha256":"51825e06c5f829065c515d51ff0d7d9304b0ce4c00c83e57c0b45e8c2acfd670"},"schema_version":"1.0"},"canonical_sha256":"3966f208c39104070d555804fe15ba9c37f4f51bddf40a166a8ec431b7e8ef5b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:14.535638Z","signature_b64":"Ma9AlJ5c3kGiMoA3Sv0C8/xmyCkQa2Lw96BB2f4yYFdOAU8WWO+qzsj1Yr2DJiWFCyD9OmVXaqrduGdie7CqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3966f208c39104070d555804fe15ba9c37f4f51bddf40a166a8ec431b7e8ef5b","last_reissued_at":"2026-05-18T04:00:14.535001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:14.535001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.2809","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-18T04:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KDSc8yGlBRHiascIoWoDfZKBJym3m+yRYZYDeNG/SV7aPi3XZ9IpppZViiMoOo4Fs4SQwB8vRsgDwOXLb8mYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T07:11:56.851167Z"},"content_sha256":"c1004cae18a88b68889e159a56b4a48f12115d93dba0f821e42dc0d17c9b2e06","schema_version":"1.0","event_id":"sha256:c1004cae18a88b68889e159a56b4a48f12115d93dba0f821e42dc0d17c9b2e06"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HFTPECGDSECAODKVLACP4FN2TQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automated Synthesis of a Finite Complexity Ordering for Saturation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mounira Kourjieh (INRIA Lorraine - LORIA / LIFC), Yannick Chevalier (IRIT)","submitted_at":"2012-03-11T19:36:46Z","abstract_excerpt":"We present in this paper a new procedure to saturate a set of clauses with respect to a well-founded ordering on ground atoms such that A < B implies Var(A) {\\subseteq} Var(B) for every atoms A and B. This condition is satisfied by any atom ordering compatible with a lexicographic, recursive, or multiset path ordering on terms. Our saturation procedure is based on a priori ordered resolution and its main novelty is the on-the-fly construction of a finite complexity atom ordering. In contrast with the usual redundancy, we give a new redundancy notion and we prove that during the saturation a no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2809","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-18T04:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v1fUcIM+MmC9WYiP+G6UAMbLurvO8wa/wP211KlxVlYqtyaQsXtbp5q1UUCgv/ecW8Vy9n7oEYbpaB9LekOPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T07:11:56.851785Z"},"content_sha256":"80787b4b01ff9e23cb15c1403f21232860baa271d8ead6abd2e161dbc1daf291","schema_version":"1.0","event_id":"sha256:80787b4b01ff9e23cb15c1403f21232860baa271d8ead6abd2e161dbc1daf291"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HFTPECGDSECAODKVLACP4FN2TQ/bundle.json","state_url":"https://pith.science/pith/HFTPECGDSECAODKVLACP4FN2TQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HFTPECGDSECAODKVLACP4FN2TQ/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-07-01T07:11:56Z","links":{"resolver":"https://pith.science/pith/HFTPECGDSECAODKVLACP4FN2TQ","bundle":"https://pith.science/pith/HFTPECGDSECAODKVLACP4FN2TQ/bundle.json","state":"https://pith.science/pith/HFTPECGDSECAODKVLACP4FN2TQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HFTPECGDSECAODKVLACP4FN2TQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HFTPECGDSECAODKVLACP4FN2TQ","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":"51825e06c5f829065c515d51ff0d7d9304b0ce4c00c83e57c0b45e8c2acfd670","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-03-11T19:36:46Z","title_canon_sha256":"bb4ac7d740e6d7118cb94b64b91762010fa4747cfc61a2468324f976b6d6991e"},"schema_version":"1.0","source":{"id":"1203.2809","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2809","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2809v1","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2809","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"HFTPECGDSECA","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HFTPECGDSECAODKV","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HFTPECGD","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:80787b4b01ff9e23cb15c1403f21232860baa271d8ead6abd2e161dbc1daf291","target":"graph","created_at":"2026-05-18T04:00:14Z","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":"We present in this paper a new procedure to saturate a set of clauses with respect to a well-founded ordering on ground atoms such that A < B implies Var(A) {\\subseteq} Var(B) for every atoms A and B. This condition is satisfied by any atom ordering compatible with a lexicographic, recursive, or multiset path ordering on terms. Our saturation procedure is based on a priori ordered resolution and its main novelty is the on-the-fly construction of a finite complexity atom ordering. In contrast with the usual redundancy, we give a new redundancy notion and we prove that during the saturation a no","authors_text":"Mounira Kourjieh (INRIA Lorraine - LORIA / LIFC), Yannick Chevalier (IRIT)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-03-11T19:36:46Z","title":"Automated Synthesis of a Finite Complexity Ordering for Saturation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2809","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:c1004cae18a88b68889e159a56b4a48f12115d93dba0f821e42dc0d17c9b2e06","target":"record","created_at":"2026-05-18T04:00:14Z","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":"51825e06c5f829065c515d51ff0d7d9304b0ce4c00c83e57c0b45e8c2acfd670","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-03-11T19:36:46Z","title_canon_sha256":"bb4ac7d740e6d7118cb94b64b91762010fa4747cfc61a2468324f976b6d6991e"},"schema_version":"1.0","source":{"id":"1203.2809","kind":"arxiv","version":1}},"canonical_sha256":"3966f208c39104070d555804fe15ba9c37f4f51bddf40a166a8ec431b7e8ef5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3966f208c39104070d555804fe15ba9c37f4f51bddf40a166a8ec431b7e8ef5b","first_computed_at":"2026-05-18T04:00:14.535001Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:14.535001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ma9AlJ5c3kGiMoA3Sv0C8/xmyCkQa2Lw96BB2f4yYFdOAU8WWO+qzsj1Yr2DJiWFCyD9OmVXaqrduGdie7CqCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:14.535638Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.2809","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1004cae18a88b68889e159a56b4a48f12115d93dba0f821e42dc0d17c9b2e06","sha256:80787b4b01ff9e23cb15c1403f21232860baa271d8ead6abd2e161dbc1daf291"],"state_sha256":"043ce64bfbea64752f7c6701a088e9edb3b6b45f850a47fc60c45b293718d422"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rNXdHpmYrwG/W69n6ast7UKibpGPXJAhSQeIBrlqjKKE/YKq036Kky78hv3CI+7TUXmotgbNK15OXIw7mDwQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T07:11:56.855429Z","bundle_sha256":"c3e8f52462e081c269ad0a5a85db37a1d15bec59178c8ce3b424216ab874767a"}}