{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:6MGHE3AJXRBI5IJXYLNDO3O7T5","short_pith_number":"pith:6MGHE3AJ","canonical_record":{"source":{"id":"0811.0134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2008-11-02T06:22:55Z","cross_cats_sorted":[],"title_canon_sha256":"ef3dffef8fbe7c75a8f04a760bc47169872e632076ef4cdb0ac58648cab1437b","abstract_canon_sha256":"5038be71ecb6ce1741aed431c7e40c7cf00bde5433e2cbf0beb7e849be425245"},"schema_version":"1.0"},"canonical_sha256":"f30c726c09bc428ea137c2da376ddf9f5704e379136c691cbaef7fddf9d39e1c","source":{"kind":"arxiv","id":"0811.0134","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.0134","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0811.0134v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.0134","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"6MGHE3AJXRBI","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"6MGHE3AJXRBI5IJX","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"6MGHE3AJ","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:6MGHE3AJXRBI5IJXYLNDO3O7T5","target":"record","payload":{"canonical_record":{"source":{"id":"0811.0134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2008-11-02T06:22:55Z","cross_cats_sorted":[],"title_canon_sha256":"ef3dffef8fbe7c75a8f04a760bc47169872e632076ef4cdb0ac58648cab1437b","abstract_canon_sha256":"5038be71ecb6ce1741aed431c7e40c7cf00bde5433e2cbf0beb7e849be425245"},"schema_version":"1.0"},"canonical_sha256":"f30c726c09bc428ea137c2da376ddf9f5704e379136c691cbaef7fddf9d39e1c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.601674Z","signature_b64":"4WzZZHXawFnrSLJbvsur+hb5AWZnF6vALZ3I096DsiT02eCEDZjSE8lkYr69xmBungLzp/RBchVLYun2ROZ+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f30c726c09bc428ea137c2da376ddf9f5704e379136c691cbaef7fddf9d39e1c","last_reissued_at":"2026-05-18T00:59:11.601160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.601160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0811.0134","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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BghgWlFedSO6kpbaUuoLU5+Cr/rYILhI3US4ElUIpdGQ6TvM2aEzGmNviAi17l4BL7cNPEGNZWMUAgsydileAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T04:49:09.849065Z"},"content_sha256":"1b14fff4105a265cd8ef6e45312605bb456c22e0f6e73409ba555ca82a89aaa0","schema_version":"1.0","event_id":"sha256:1b14fff4105a265cd8ef6e45312605bb456c22e0f6e73409ba555ca82a89aaa0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:6MGHE3AJXRBI5IJXYLNDO3O7T5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Parser Design Algorithm Based on Artificial Ants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Amit Konar, Ayan Acharya, Deepyaman Maiti, Janarthanan Ramadoss","submitted_at":"2008-11-02T06:22:55Z","abstract_excerpt":"This article presents a unique design for a parser using the Ant Colony Optimization algorithm. The paper implements the intuitive thought process of human mind through the activities of artificial ants. The scheme presented here uses a bottom-up approach and the parsing program can directly use ambiguous or redundant grammars. We allocate a node corresponding to each production rule present in the given grammar. Each node is connected to all other nodes (representing other production rules), thereby establishing a completely connected graph susceptible to the movement of artificial ants. Each"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.0134","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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d09Rj9HJbx25NMEpywA1RqXJ0PHvu0+RVok8sIrPQR+IMdlezNBlGG1M7kAsB3vrERuvdQQHB8Jv4kEZJrsKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T04:49:09.849433Z"},"content_sha256":"5b07d20106a48757f3bfa225ed6563faa0d43bab911895e136f430467bbb4a5f","schema_version":"1.0","event_id":"sha256:5b07d20106a48757f3bfa225ed6563faa0d43bab911895e136f430467bbb4a5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6MGHE3AJXRBI5IJXYLNDO3O7T5/bundle.json","state_url":"https://pith.science/pith/6MGHE3AJXRBI5IJXYLNDO3O7T5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6MGHE3AJXRBI5IJXYLNDO3O7T5/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-25T04:49:09Z","links":{"resolver":"https://pith.science/pith/6MGHE3AJXRBI5IJXYLNDO3O7T5","bundle":"https://pith.science/pith/6MGHE3AJXRBI5IJXYLNDO3O7T5/bundle.json","state":"https://pith.science/pith/6MGHE3AJXRBI5IJXYLNDO3O7T5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6MGHE3AJXRBI5IJXYLNDO3O7T5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:6MGHE3AJXRBI5IJXYLNDO3O7T5","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":"5038be71ecb6ce1741aed431c7e40c7cf00bde5433e2cbf0beb7e849be425245","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2008-11-02T06:22:55Z","title_canon_sha256":"ef3dffef8fbe7c75a8f04a760bc47169872e632076ef4cdb0ac58648cab1437b"},"schema_version":"1.0","source":{"id":"0811.0134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.0134","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0811.0134v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.0134","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"6MGHE3AJXRBI","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"6MGHE3AJXRBI5IJX","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"6MGHE3AJ","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:5b07d20106a48757f3bfa225ed6563faa0d43bab911895e136f430467bbb4a5f","target":"graph","created_at":"2026-05-18T00:59:11Z","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":"This article presents a unique design for a parser using the Ant Colony Optimization algorithm. The paper implements the intuitive thought process of human mind through the activities of artificial ants. The scheme presented here uses a bottom-up approach and the parsing program can directly use ambiguous or redundant grammars. We allocate a node corresponding to each production rule present in the given grammar. Each node is connected to all other nodes (representing other production rules), thereby establishing a completely connected graph susceptible to the movement of artificial ants. Each","authors_text":"Amit Konar, Ayan Acharya, Deepyaman Maiti, Janarthanan Ramadoss","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2008-11-02T06:22:55Z","title":"A Novel Parser Design Algorithm Based on Artificial Ants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.0134","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:1b14fff4105a265cd8ef6e45312605bb456c22e0f6e73409ba555ca82a89aaa0","target":"record","created_at":"2026-05-18T00:59:11Z","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":"5038be71ecb6ce1741aed431c7e40c7cf00bde5433e2cbf0beb7e849be425245","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2008-11-02T06:22:55Z","title_canon_sha256":"ef3dffef8fbe7c75a8f04a760bc47169872e632076ef4cdb0ac58648cab1437b"},"schema_version":"1.0","source":{"id":"0811.0134","kind":"arxiv","version":1}},"canonical_sha256":"f30c726c09bc428ea137c2da376ddf9f5704e379136c691cbaef7fddf9d39e1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f30c726c09bc428ea137c2da376ddf9f5704e379136c691cbaef7fddf9d39e1c","first_computed_at":"2026-05-18T00:59:11.601160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:11.601160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4WzZZHXawFnrSLJbvsur+hb5AWZnF6vALZ3I096DsiT02eCEDZjSE8lkYr69xmBungLzp/RBchVLYun2ROZ+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:11.601674Z","signed_message":"canonical_sha256_bytes"},"source_id":"0811.0134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b14fff4105a265cd8ef6e45312605bb456c22e0f6e73409ba555ca82a89aaa0","sha256:5b07d20106a48757f3bfa225ed6563faa0d43bab911895e136f430467bbb4a5f"],"state_sha256":"ac546551c836e230b974f4068e62d7319e1d74bac36ef2a146e99b08613714fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PxvfNJUOUFN17RNDFfddaRS5F0wd9ue8vQo/r5RB3mzsG+jS+7BhP3nqR3fS41fYP5kW78D0M1RKHWlH3cTTBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T04:49:09.851391Z","bundle_sha256":"9230bbb3d8358cc7011b64eccc278c27cac8bc472d7bbd679661a2cb7194f6c1"}}