{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3HXASQIVO3VQ7LO44IP4HGENFX","short_pith_number":"pith:3HXASQIV","schema_version":"1.0","canonical_sha256":"d9ee09411576eb0faddce21fc3988d2dce0bce8f75491b62d9fbd7d3e6eb749e","source":{"kind":"arxiv","id":"1404.3382","version":1},"attestation_state":"computed","paper":{"title":"An Approach for Computing Dynamic Slice of Concurrent Aspect-Oriented Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Abhishek Ray, Durga Prasad Mohapatra, Siba Mishra","submitted_at":"2014-04-13T13:48:04Z","abstract_excerpt":"We propose a dynamic slicing algorithm to compute the slice of concurrent aspect-oriented programs. We use a dependence based intermediate program representation called Concurrent Aspect-oriented System Dependence Graph (CASDG) to represent a concurrent aspect-oriented program. The CASDG of an aspect-oriented program consists of a system dependence graph (SDG) for the non-aspect code, a group of dependence graphs for aspect code and some additional dependence edges used to connect the system dependence graph for the non-aspect code to dependence graph for aspect code. The proposed dynamic slic"},"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":"1404.3382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2014-04-13T13:48:04Z","cross_cats_sorted":[],"title_canon_sha256":"554c7c088fe443e5b5b21c4598cb7612b230d0f62d5d3e4a3797e714e611971d","abstract_canon_sha256":"f30784a5f30d58ae5b8676a0952d0586307a660f18aa0807ad6c1d883c38317c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:15.297583Z","signature_b64":"GBA5T/toY4N71OkT1PETflQ8hpEtKaS6JvfCElZveVHgcF3ev07Aq8HoEa5Kz85vNFjq69ULqVkSPfm1ssldCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9ee09411576eb0faddce21fc3988d2dce0bce8f75491b62d9fbd7d3e6eb749e","last_reissued_at":"2026-05-18T02:54:15.297101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:15.297101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Approach for Computing Dynamic Slice of Concurrent Aspect-Oriented Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Abhishek Ray, Durga Prasad Mohapatra, Siba Mishra","submitted_at":"2014-04-13T13:48:04Z","abstract_excerpt":"We propose a dynamic slicing algorithm to compute the slice of concurrent aspect-oriented programs. We use a dependence based intermediate program representation called Concurrent Aspect-oriented System Dependence Graph (CASDG) to represent a concurrent aspect-oriented program. The CASDG of an aspect-oriented program consists of a system dependence graph (SDG) for the non-aspect code, a group of dependence graphs for aspect code and some additional dependence edges used to connect the system dependence graph for the non-aspect code to dependence graph for aspect code. The proposed dynamic slic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3382","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":"1404.3382","created_at":"2026-05-18T02:54:15.297174+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3382v1","created_at":"2026-05-18T02:54:15.297174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3382","created_at":"2026-05-18T02:54:15.297174+00:00"},{"alias_kind":"pith_short_12","alias_value":"3HXASQIVO3VQ","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3HXASQIVO3VQ7LO4","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3HXASQIV","created_at":"2026-05-18T12:28:11.866339+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/3HXASQIVO3VQ7LO44IP4HGENFX","json":"https://pith.science/pith/3HXASQIVO3VQ7LO44IP4HGENFX.json","graph_json":"https://pith.science/api/pith-number/3HXASQIVO3VQ7LO44IP4HGENFX/graph.json","events_json":"https://pith.science/api/pith-number/3HXASQIVO3VQ7LO44IP4HGENFX/events.json","paper":"https://pith.science/paper/3HXASQIV"},"agent_actions":{"view_html":"https://pith.science/pith/3HXASQIVO3VQ7LO44IP4HGENFX","download_json":"https://pith.science/pith/3HXASQIVO3VQ7LO44IP4HGENFX.json","view_paper":"https://pith.science/paper/3HXASQIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3382&json=true","fetch_graph":"https://pith.science/api/pith-number/3HXASQIVO3VQ7LO44IP4HGENFX/graph.json","fetch_events":"https://pith.science/api/pith-number/3HXASQIVO3VQ7LO44IP4HGENFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3HXASQIVO3VQ7LO44IP4HGENFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3HXASQIVO3VQ7LO44IP4HGENFX/action/storage_attestation","attest_author":"https://pith.science/pith/3HXASQIVO3VQ7LO44IP4HGENFX/action/author_attestation","sign_citation":"https://pith.science/pith/3HXASQIVO3VQ7LO44IP4HGENFX/action/citation_signature","submit_replication":"https://pith.science/pith/3HXASQIVO3VQ7LO44IP4HGENFX/action/replication_record"}},"created_at":"2026-05-18T02:54:15.297174+00:00","updated_at":"2026-05-18T02:54:15.297174+00:00"}