{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ADL3GI3LJYVEN4GZVKAF2XWLGH","short_pith_number":"pith:ADL3GI3L","schema_version":"1.0","canonical_sha256":"00d7b3236b4e2a46f0d9aa805d5ecb31e01e43337dbc7b7a2c232c068704f37d","source":{"kind":"arxiv","id":"2411.17091","version":1},"attestation_state":"computed","paper":{"title":"LESS: Efficient Log Storage System Based on Learned Model and Minimum Attribute Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Hai Wan, Haoran Dang, Xibin Zhao, Zhiyang Cheng, Zizhen Zhu","submitted_at":"2024-11-26T04:06:42Z","abstract_excerpt":"In recent years, cyber attacks have become increasingly sophisticated and persistent. Detection and investigation based on the provenance graph can effectively mitigate cyber intrusion. However, in the long time span of defenses, the sheer size of the provenance graph will pose significant challenges to the storage systems. Faced with long-term storage tasks, existing methods are unable to simultaneously achieve lossless information, efficient compression, and fast query support. In this paper, we propose a novel provenance graph storage system, LESS, which consumes smaller storage space and s"},"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":"2411.17091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2024-11-26T04:06:42Z","cross_cats_sorted":[],"title_canon_sha256":"73588b2067cfb5266f92b1f4bb916e38828ba7b004c970bfe2389f8f524107d7","abstract_canon_sha256":"0e2403a53d52ad23428afc6f33e350a8c14cbd520444db03392fbfa4733dbf6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:27.270995Z","signature_b64":"FlCQ23a3avjDw7FylmcY1s36TWew4QC3RMct04FqLuX6LnrU/q7h0MwqsA/IjAoGmYi1oLMGqBpcHIRIvuPVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00d7b3236b4e2a46f0d9aa805d5ecb31e01e43337dbc7b7a2c232c068704f37d","last_reissued_at":"2026-07-05T09:40:27.270494Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:27.270494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LESS: Efficient Log Storage System Based on Learned Model and Minimum Attribute Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Hai Wan, Haoran Dang, Xibin Zhao, Zhiyang Cheng, Zizhen Zhu","submitted_at":"2024-11-26T04:06:42Z","abstract_excerpt":"In recent years, cyber attacks have become increasingly sophisticated and persistent. Detection and investigation based on the provenance graph can effectively mitigate cyber intrusion. However, in the long time span of defenses, the sheer size of the provenance graph will pose significant challenges to the storage systems. Faced with long-term storage tasks, existing methods are unable to simultaneously achieve lossless information, efficient compression, and fast query support. In this paper, we propose a novel provenance graph storage system, LESS, which consumes smaller storage space and s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17091","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.17091/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.17091","created_at":"2026-07-05T09:40:27.270554+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.17091v1","created_at":"2026-07-05T09:40:27.270554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17091","created_at":"2026-07-05T09:40:27.270554+00:00"},{"alias_kind":"pith_short_12","alias_value":"ADL3GI3LJYVE","created_at":"2026-07-05T09:40:27.270554+00:00"},{"alias_kind":"pith_short_16","alias_value":"ADL3GI3LJYVEN4GZ","created_at":"2026-07-05T09:40:27.270554+00:00"},{"alias_kind":"pith_short_8","alias_value":"ADL3GI3L","created_at":"2026-07-05T09:40:27.270554+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/ADL3GI3LJYVEN4GZVKAF2XWLGH","json":"https://pith.science/pith/ADL3GI3LJYVEN4GZVKAF2XWLGH.json","graph_json":"https://pith.science/api/pith-number/ADL3GI3LJYVEN4GZVKAF2XWLGH/graph.json","events_json":"https://pith.science/api/pith-number/ADL3GI3LJYVEN4GZVKAF2XWLGH/events.json","paper":"https://pith.science/paper/ADL3GI3L"},"agent_actions":{"view_html":"https://pith.science/pith/ADL3GI3LJYVEN4GZVKAF2XWLGH","download_json":"https://pith.science/pith/ADL3GI3LJYVEN4GZVKAF2XWLGH.json","view_paper":"https://pith.science/paper/ADL3GI3L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.17091&json=true","fetch_graph":"https://pith.science/api/pith-number/ADL3GI3LJYVEN4GZVKAF2XWLGH/graph.json","fetch_events":"https://pith.science/api/pith-number/ADL3GI3LJYVEN4GZVKAF2XWLGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ADL3GI3LJYVEN4GZVKAF2XWLGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ADL3GI3LJYVEN4GZVKAF2XWLGH/action/storage_attestation","attest_author":"https://pith.science/pith/ADL3GI3LJYVEN4GZVKAF2XWLGH/action/author_attestation","sign_citation":"https://pith.science/pith/ADL3GI3LJYVEN4GZVKAF2XWLGH/action/citation_signature","submit_replication":"https://pith.science/pith/ADL3GI3LJYVEN4GZVKAF2XWLGH/action/replication_record"}},"created_at":"2026-07-05T09:40:27.270554+00:00","updated_at":"2026-07-05T09:40:27.270554+00:00"}