{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KG4L2TI5HR3UBTTNFWT3X35F26","short_pith_number":"pith:KG4L2TI5","schema_version":"1.0","canonical_sha256":"51b8bd4d1d3c7740ce6d2da7bbefa5d79137dbed99ff0c2088ae7f6a71f050a4","source":{"kind":"arxiv","id":"1107.4223","version":1},"attestation_state":"computed","paper":{"title":"Sorting Algorithms with Restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hakob Aslanyan","submitted_at":"2011-07-21T10:11:15Z","abstract_excerpt":"Sorting is one of the most used and well investigated algorithmic problem [1]. Traditional postulation supposes the sorting data archived, and the elementary operation as comparisons of two numbers. In a view of appearance of new processors and applied problems with data streams, sorting changed its face. This changes and generalizations are the subject of investigation in the research below."},"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":"1107.4223","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-21T10:11:15Z","cross_cats_sorted":[],"title_canon_sha256":"ffaf5c1f3839c062cd5e3a652943bf60beffc6a7b675423bfaecd7ef789f7f67","abstract_canon_sha256":"8c9c4b8eb84d14b41014187c1fc908fb70fae7ae3e4f4774350ef687c2511a1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:12.949518Z","signature_b64":"8uFK7NCBBrYOFV9tSsb0Sbhj+YWP+W+ufV6Wpw3iukW7Xp9OOdtjcTuN1XPY5SpZAj2Byy3NCD69FIatb/k5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51b8bd4d1d3c7740ce6d2da7bbefa5d79137dbed99ff0c2088ae7f6a71f050a4","last_reissued_at":"2026-05-18T04:17:12.948848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:12.948848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sorting Algorithms with Restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hakob Aslanyan","submitted_at":"2011-07-21T10:11:15Z","abstract_excerpt":"Sorting is one of the most used and well investigated algorithmic problem [1]. Traditional postulation supposes the sorting data archived, and the elementary operation as comparisons of two numbers. In a view of appearance of new processors and applied problems with data streams, sorting changed its face. This changes and generalizations are the subject of investigation in the research below."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4223","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":"1107.4223","created_at":"2026-05-18T04:17:12.948942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.4223v1","created_at":"2026-05-18T04:17:12.948942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4223","created_at":"2026-05-18T04:17:12.948942+00:00"},{"alias_kind":"pith_short_12","alias_value":"KG4L2TI5HR3U","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"KG4L2TI5HR3UBTTN","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"KG4L2TI5","created_at":"2026-05-18T12:26:32.869790+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/KG4L2TI5HR3UBTTNFWT3X35F26","json":"https://pith.science/pith/KG4L2TI5HR3UBTTNFWT3X35F26.json","graph_json":"https://pith.science/api/pith-number/KG4L2TI5HR3UBTTNFWT3X35F26/graph.json","events_json":"https://pith.science/api/pith-number/KG4L2TI5HR3UBTTNFWT3X35F26/events.json","paper":"https://pith.science/paper/KG4L2TI5"},"agent_actions":{"view_html":"https://pith.science/pith/KG4L2TI5HR3UBTTNFWT3X35F26","download_json":"https://pith.science/pith/KG4L2TI5HR3UBTTNFWT3X35F26.json","view_paper":"https://pith.science/paper/KG4L2TI5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.4223&json=true","fetch_graph":"https://pith.science/api/pith-number/KG4L2TI5HR3UBTTNFWT3X35F26/graph.json","fetch_events":"https://pith.science/api/pith-number/KG4L2TI5HR3UBTTNFWT3X35F26/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KG4L2TI5HR3UBTTNFWT3X35F26/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KG4L2TI5HR3UBTTNFWT3X35F26/action/storage_attestation","attest_author":"https://pith.science/pith/KG4L2TI5HR3UBTTNFWT3X35F26/action/author_attestation","sign_citation":"https://pith.science/pith/KG4L2TI5HR3UBTTNFWT3X35F26/action/citation_signature","submit_replication":"https://pith.science/pith/KG4L2TI5HR3UBTTNFWT3X35F26/action/replication_record"}},"created_at":"2026-05-18T04:17:12.948942+00:00","updated_at":"2026-05-18T04:17:12.948942+00:00"}