{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7JRJJ3YY652WYSD6N27POKE3L7","short_pith_number":"pith:7JRJJ3YY","schema_version":"1.0","canonical_sha256":"fa6294ef18f7756c487e6ebef7289b5ff62fa124483bebaed16790b15cc80c6a","source":{"kind":"arxiv","id":"1201.3976","version":1},"attestation_state":"computed","paper":{"title":"Construction of Learning Path Using Ant Colony Optimization from a Frequent Pattern Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Ranjan Dasgupta, Sandipan Sahu, Souvik Sengupta","submitted_at":"2012-01-19T06:09:53Z","abstract_excerpt":"In an e-Learning system a learner may come across multiple unknown terms, which are generally hyperlinked, while reading a text definition or theory on any topic. It becomes even harder when one tries to understand those unknown terms through further such links and they again find some new terms that have new links. As a consequence they get confused where to initiate from and what are the prerequisites. So it is very obvious for the learner to make a choice of what should be learnt before what. In this paper we have taken the data mining based frequent pattern graph model to define the associ"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1201.3976","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2012-01-19T06:09:53Z","cross_cats_sorted":[],"title_canon_sha256":"a91a8bb0359b8b4758b82b3d7a073880ab5bab07b677704f27f1e5e8aaf92a47","abstract_canon_sha256":"99ad66783d6797fb4958e1d657124b643e9b547d48ef9abcc982058f66e68647"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:16.307461Z","signature_b64":"k38SpEhdOaBFVFvClbGdPfuGBPLJ7zeNluvNXtsgj6MEbNzPO6lrS+QT6MxK+rcT1SGN2b36KAa9gUye9LTBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa6294ef18f7756c487e6ebef7289b5ff62fa124483bebaed16790b15cc80c6a","last_reissued_at":"2026-05-18T04:04:16.306612Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:16.306612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction of Learning Path Using Ant Colony Optimization from a Frequent Pattern Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Ranjan Dasgupta, Sandipan Sahu, Souvik Sengupta","submitted_at":"2012-01-19T06:09:53Z","abstract_excerpt":"In an e-Learning system a learner may come across multiple unknown terms, which are generally hyperlinked, while reading a text definition or theory on any topic. It becomes even harder when one tries to understand those unknown terms through further such links and they again find some new terms that have new links. As a consequence they get confused where to initiate from and what are the prerequisites. So it is very obvious for the learner to make a choice of what should be learnt before what. In this paper we have taken the data mining based frequent pattern graph model to define the associ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3976","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.3976","created_at":"2026-05-18T04:04:16.306761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.3976v1","created_at":"2026-05-18T04:04:16.306761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3976","created_at":"2026-05-18T04:04:16.306761+00:00"},{"alias_kind":"pith_short_12","alias_value":"7JRJJ3YY652W","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7JRJJ3YY652WYSD6","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7JRJJ3YY","created_at":"2026-05-18T12:26:58.693483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7JRJJ3YY652WYSD6N27POKE3L7","json":"https://pith.science/pith/7JRJJ3YY652WYSD6N27POKE3L7.json","graph_json":"https://pith.science/api/pith-number/7JRJJ3YY652WYSD6N27POKE3L7/graph.json","events_json":"https://pith.science/api/pith-number/7JRJJ3YY652WYSD6N27POKE3L7/events.json","paper":"https://pith.science/paper/7JRJJ3YY"},"agent_actions":{"view_html":"https://pith.science/pith/7JRJJ3YY652WYSD6N27POKE3L7","download_json":"https://pith.science/pith/7JRJJ3YY652WYSD6N27POKE3L7.json","view_paper":"https://pith.science/paper/7JRJJ3YY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.3976&json=true","fetch_graph":"https://pith.science/api/pith-number/7JRJJ3YY652WYSD6N27POKE3L7/graph.json","fetch_events":"https://pith.science/api/pith-number/7JRJJ3YY652WYSD6N27POKE3L7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7JRJJ3YY652WYSD6N27POKE3L7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7JRJJ3YY652WYSD6N27POKE3L7/action/storage_attestation","attest_author":"https://pith.science/pith/7JRJJ3YY652WYSD6N27POKE3L7/action/author_attestation","sign_citation":"https://pith.science/pith/7JRJJ3YY652WYSD6N27POKE3L7/action/citation_signature","submit_replication":"https://pith.science/pith/7JRJJ3YY652WYSD6N27POKE3L7/action/replication_record"}},"created_at":"2026-05-18T04:04:16.306761+00:00","updated_at":"2026-05-18T04:04:16.306761+00:00"}