{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6SD62QEJPSKQQWRT4TM6HM2AFP","short_pith_number":"pith:6SD62QEJ","schema_version":"1.0","canonical_sha256":"f487ed40897c95085a33e4d9e3b3402bc395e1d9f58af8ec54cc9b70d2908b37","source":{"kind":"arxiv","id":"1711.09859","version":1},"attestation_state":"computed","paper":{"title":"Frameworks for Designing In-place Graph Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anish Mukherjee, Sankardeep Chakraborty, Srinivasa Rao Satti, Venkatesh Raman","submitted_at":"2017-11-27T18:10:01Z","abstract_excerpt":"Read-only memory model is a classical model of computation to study time-space tradeoffs of algorithms. One of the classical results on the ROM model is that any sorting algorithm that uses O(s) words of extra space requires $\\Omega (n^2/s)$ comparisons for $ \\lg n \\leq s \\leq n/\\lg n$ and the bound has also been recently matched by an algorithm. However, if we relax the model (from ROM), we do have sorting algorithms (say Heapsort) that can sort using $O(n \\lg n)$ comparisons using $O(\\lg n)$ bits of extra space, even keeping a permutation of the given input sequence at any point of time duri"},"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":"1711.09859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-27T18:10:01Z","cross_cats_sorted":[],"title_canon_sha256":"4596db2c4be03e161d3f5ce25ddf8eb919a527743b8939b2a2793b35b9b68432","abstract_canon_sha256":"5a411a3b98c581be6a9f619eaee253978a49d3bcddea27a56b6c2bc5ff303dc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:34.309570Z","signature_b64":"CfIi+WTbSh6HKHAfz2EQDaergFn2l3uPk2rJ5CA7i2lbQtsyRa6/MFbal6+Ccxe9fBrxBUGyWipNc18UaRtmDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f487ed40897c95085a33e4d9e3b3402bc395e1d9f58af8ec54cc9b70d2908b37","last_reissued_at":"2026-05-18T00:29:34.308917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:34.308917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Frameworks for Designing In-place Graph Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anish Mukherjee, Sankardeep Chakraborty, Srinivasa Rao Satti, Venkatesh Raman","submitted_at":"2017-11-27T18:10:01Z","abstract_excerpt":"Read-only memory model is a classical model of computation to study time-space tradeoffs of algorithms. One of the classical results on the ROM model is that any sorting algorithm that uses O(s) words of extra space requires $\\Omega (n^2/s)$ comparisons for $ \\lg n \\leq s \\leq n/\\lg n$ and the bound has also been recently matched by an algorithm. However, if we relax the model (from ROM), we do have sorting algorithms (say Heapsort) that can sort using $O(n \\lg n)$ comparisons using $O(\\lg n)$ bits of extra space, even keeping a permutation of the given input sequence at any point of time duri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09859","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":"1711.09859","created_at":"2026-05-18T00:29:34.309012+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.09859v1","created_at":"2026-05-18T00:29:34.309012+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09859","created_at":"2026-05-18T00:29:34.309012+00:00"},{"alias_kind":"pith_short_12","alias_value":"6SD62QEJPSKQ","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6SD62QEJPSKQQWRT","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6SD62QEJ","created_at":"2026-05-18T12:31:03.183658+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/6SD62QEJPSKQQWRT4TM6HM2AFP","json":"https://pith.science/pith/6SD62QEJPSKQQWRT4TM6HM2AFP.json","graph_json":"https://pith.science/api/pith-number/6SD62QEJPSKQQWRT4TM6HM2AFP/graph.json","events_json":"https://pith.science/api/pith-number/6SD62QEJPSKQQWRT4TM6HM2AFP/events.json","paper":"https://pith.science/paper/6SD62QEJ"},"agent_actions":{"view_html":"https://pith.science/pith/6SD62QEJPSKQQWRT4TM6HM2AFP","download_json":"https://pith.science/pith/6SD62QEJPSKQQWRT4TM6HM2AFP.json","view_paper":"https://pith.science/paper/6SD62QEJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.09859&json=true","fetch_graph":"https://pith.science/api/pith-number/6SD62QEJPSKQQWRT4TM6HM2AFP/graph.json","fetch_events":"https://pith.science/api/pith-number/6SD62QEJPSKQQWRT4TM6HM2AFP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6SD62QEJPSKQQWRT4TM6HM2AFP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6SD62QEJPSKQQWRT4TM6HM2AFP/action/storage_attestation","attest_author":"https://pith.science/pith/6SD62QEJPSKQQWRT4TM6HM2AFP/action/author_attestation","sign_citation":"https://pith.science/pith/6SD62QEJPSKQQWRT4TM6HM2AFP/action/citation_signature","submit_replication":"https://pith.science/pith/6SD62QEJPSKQQWRT4TM6HM2AFP/action/replication_record"}},"created_at":"2026-05-18T00:29:34.309012+00:00","updated_at":"2026-05-18T00:29:34.309012+00:00"}