{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GIZCKN22SJW7PTI4ORXUONOLYF","short_pith_number":"pith:GIZCKN22","canonical_record":{"source":{"id":"1311.4088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-16T18:43:19Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"82e9105177eeec14a0250db5150679a09628186f09420de3663c9c26e64fe9d0","abstract_canon_sha256":"f48f61f0a8be7dfda3975274e0b31f148e6d763f37cc32a75bdf24ec24c14425"},"schema_version":"1.0"},"canonical_sha256":"323225375a926df7cd1c746f4735cbc166bbd8a22852acebdfedb3d03d88bb6a","source":{"kind":"arxiv","id":"1311.4088","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4088","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4088v1","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4088","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"pith_short_12","alias_value":"GIZCKN22SJW7","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GIZCKN22SJW7PTI4","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GIZCKN22","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GIZCKN22SJW7PTI4ORXUONOLYF","target":"record","payload":{"canonical_record":{"source":{"id":"1311.4088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-16T18:43:19Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"82e9105177eeec14a0250db5150679a09628186f09420de3663c9c26e64fe9d0","abstract_canon_sha256":"f48f61f0a8be7dfda3975274e0b31f148e6d763f37cc32a75bdf24ec24c14425"},"schema_version":"1.0"},"canonical_sha256":"323225375a926df7cd1c746f4735cbc166bbd8a22852acebdfedb3d03d88bb6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:53.649626Z","signature_b64":"a9ZBXgn3kBrlrBadRBqVXDIzTkzN4Hiy85kIPhiqqfmotUH+Hv9QTxE6uL1zxEVQ/vKQlw4ENb63zWDSXlivAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"323225375a926df7cd1c746f4735cbc166bbd8a22852acebdfedb3d03d88bb6a","last_reissued_at":"2026-05-18T03:06:53.648903Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:53.648903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.4088","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-18T03:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8QRyFQGdoqDCiSmfg9X2KbYm6r6z6M1+syBHqbq6rQy/lrxoFOwrDledR8kIaOhgDsPAvwS0EtXpxan+tifPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:11:53.666181Z"},"content_sha256":"cf3ebdc2f9c74597bc137176fcab55b8753b968522a508e55b0ddb71b83ce344","schema_version":"1.0","event_id":"sha256:cf3ebdc2f9c74597bc137176fcab55b8753b968522a508e55b0ddb71b83ce344"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GIZCKN22SJW7PTI4ORXUONOLYF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Optimization of Running Queries in Relational Databases Using ANT-Colony Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.DB","authors_text":"Adel Alinezhad Kolaei, Marzieh Ahmadzadeh","submitted_at":"2013-11-16T18:43:19Z","abstract_excerpt":"The issue of optimizing queries is a cost-sensitive process and with respect to the number of associated tables in a query, its number of permutations grows exponentially. On one hand, in comparison with other operators in relational database, join operator is the most difficult and complicated one in terms of optimization for reducing its runtime. Accordingly, various algorithms have so far been proposed to solve this problem. On the other hand, the success of any database management system (DBMS) means exploiting the query model. In the current paper, the heuristic ant algorithm has been pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4088","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-18T03:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"98tCzK9GVRy5HDX2tEoyXkKI+l/KNrI6v81eXir2YCMB+eKvxzlwIcb4YrxDl233DvLeA+UcDPpVD6dxARAPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:11:53.666549Z"},"content_sha256":"43ecd1d20beb4e257d2264d9409c647f9b8989eda477ad9c78b9bc6b2c9e9d97","schema_version":"1.0","event_id":"sha256:43ecd1d20beb4e257d2264d9409c647f9b8989eda477ad9c78b9bc6b2c9e9d97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIZCKN22SJW7PTI4ORXUONOLYF/bundle.json","state_url":"https://pith.science/pith/GIZCKN22SJW7PTI4ORXUONOLYF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIZCKN22SJW7PTI4ORXUONOLYF/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-23T14:11:53Z","links":{"resolver":"https://pith.science/pith/GIZCKN22SJW7PTI4ORXUONOLYF","bundle":"https://pith.science/pith/GIZCKN22SJW7PTI4ORXUONOLYF/bundle.json","state":"https://pith.science/pith/GIZCKN22SJW7PTI4ORXUONOLYF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIZCKN22SJW7PTI4ORXUONOLYF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GIZCKN22SJW7PTI4ORXUONOLYF","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":"f48f61f0a8be7dfda3975274e0b31f148e6d763f37cc32a75bdf24ec24c14425","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-16T18:43:19Z","title_canon_sha256":"82e9105177eeec14a0250db5150679a09628186f09420de3663c9c26e64fe9d0"},"schema_version":"1.0","source":{"id":"1311.4088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4088","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4088v1","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4088","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"pith_short_12","alias_value":"GIZCKN22SJW7","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GIZCKN22SJW7PTI4","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GIZCKN22","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:43ecd1d20beb4e257d2264d9409c647f9b8989eda477ad9c78b9bc6b2c9e9d97","target":"graph","created_at":"2026-05-18T03:06:53Z","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":"The issue of optimizing queries is a cost-sensitive process and with respect to the number of associated tables in a query, its number of permutations grows exponentially. On one hand, in comparison with other operators in relational database, join operator is the most difficult and complicated one in terms of optimization for reducing its runtime. Accordingly, various algorithms have so far been proposed to solve this problem. On the other hand, the success of any database management system (DBMS) means exploiting the query model. In the current paper, the heuristic ant algorithm has been pro","authors_text":"Adel Alinezhad Kolaei, Marzieh Ahmadzadeh","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-16T18:43:19Z","title":"The Optimization of Running Queries in Relational Databases Using ANT-Colony Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4088","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:cf3ebdc2f9c74597bc137176fcab55b8753b968522a508e55b0ddb71b83ce344","target":"record","created_at":"2026-05-18T03:06:53Z","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":"f48f61f0a8be7dfda3975274e0b31f148e6d763f37cc32a75bdf24ec24c14425","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-16T18:43:19Z","title_canon_sha256":"82e9105177eeec14a0250db5150679a09628186f09420de3663c9c26e64fe9d0"},"schema_version":"1.0","source":{"id":"1311.4088","kind":"arxiv","version":1}},"canonical_sha256":"323225375a926df7cd1c746f4735cbc166bbd8a22852acebdfedb3d03d88bb6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"323225375a926df7cd1c746f4735cbc166bbd8a22852acebdfedb3d03d88bb6a","first_computed_at":"2026-05-18T03:06:53.648903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:53.648903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a9ZBXgn3kBrlrBadRBqVXDIzTkzN4Hiy85kIPhiqqfmotUH+Hv9QTxE6uL1zxEVQ/vKQlw4ENb63zWDSXlivAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:53.649626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf3ebdc2f9c74597bc137176fcab55b8753b968522a508e55b0ddb71b83ce344","sha256:43ecd1d20beb4e257d2264d9409c647f9b8989eda477ad9c78b9bc6b2c9e9d97"],"state_sha256":"8dd0fa4bc2e3b35a7aa49026b532190aabc0f95e31e81605a839e9547d87f777"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vOKkGSSIXS3CtbqyqbCric/+3yXbhM4aX7CMIiL5rbgC1LBFfaVTHdzvL10lltbVkePSyq0ZD9JosQZkIcK7AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:11:53.668471Z","bundle_sha256":"9564ec594b1e711ca4e8996ddae5b1eb72f4af69684268eb3ae50a730bf7d956"}}