{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TWBJ3GJMYVXWTJX76FJAE76IYI","short_pith_number":"pith:TWBJ3GJM","schema_version":"1.0","canonical_sha256":"9d829d992cc56f69a6fff152027fc8c214d5ccb0bdbe5133ba504ac585c94c8c","source":{"kind":"arxiv","id":"1807.01603","version":2},"attestation_state":"computed","paper":{"title":"BIN-CT: Urban Waste Collection based in Predicting the Container Fill Level","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Enrique Alba, Javier Ferrer","submitted_at":"2018-07-03T10:50:03Z","abstract_excerpt":"The fast demographic growth, together with the concentration of the population in cities and the increasing amount of daily waste, are factors that push to the limit the ability of waste assimilation by Nature. Therefore, we need technological means to make an optimal management of the waste collection process, which represents 70% of the operational cost in waste treatment. In this article, we present a free intelligent software system, based on computational learning algorithms, which plans the best routes for waste collection supported by past (historical) and future (predictions) data.\n  T"},"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":"1807.01603","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-07-03T10:50:03Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"39b124acd397954cb8e60c344a644c784710bac98378f4db2944c6d63fc60636","abstract_canon_sha256":"161c8145564648a4c5ded39e3db3955d14f526b3ef7e5472d4b86b3f82b0e2ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:06.618495Z","signature_b64":"bPUloj9B13/pJ10KNG+084RQuMgwy5UgYe4ZLQx4KOTzcy0xrHW4vgHptBmWJNV2qKanzoYnfLDhcQWIzrb+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d829d992cc56f69a6fff152027fc8c214d5ccb0bdbe5133ba504ac585c94c8c","last_reissued_at":"2026-05-17T23:48:06.618112Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:06.618112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BIN-CT: Urban Waste Collection based in Predicting the Container Fill Level","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Enrique Alba, Javier Ferrer","submitted_at":"2018-07-03T10:50:03Z","abstract_excerpt":"The fast demographic growth, together with the concentration of the population in cities and the increasing amount of daily waste, are factors that push to the limit the ability of waste assimilation by Nature. Therefore, we need technological means to make an optimal management of the waste collection process, which represents 70% of the operational cost in waste treatment. In this article, we present a free intelligent software system, based on computational learning algorithms, which plans the best routes for waste collection supported by past (historical) and future (predictions) data.\n  T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01603","kind":"arxiv","version":2},"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":"1807.01603","created_at":"2026-05-17T23:48:06.618176+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.01603v2","created_at":"2026-05-17T23:48:06.618176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01603","created_at":"2026-05-17T23:48:06.618176+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWBJ3GJMYVXW","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWBJ3GJMYVXWTJX7","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWBJ3GJM","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.02425","citing_title":"Random Error Sampling-based Recurrent Neural Network Architecture Optimization","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TWBJ3GJMYVXWTJX76FJAE76IYI","json":"https://pith.science/pith/TWBJ3GJMYVXWTJX76FJAE76IYI.json","graph_json":"https://pith.science/api/pith-number/TWBJ3GJMYVXWTJX76FJAE76IYI/graph.json","events_json":"https://pith.science/api/pith-number/TWBJ3GJMYVXWTJX76FJAE76IYI/events.json","paper":"https://pith.science/paper/TWBJ3GJM"},"agent_actions":{"view_html":"https://pith.science/pith/TWBJ3GJMYVXWTJX76FJAE76IYI","download_json":"https://pith.science/pith/TWBJ3GJMYVXWTJX76FJAE76IYI.json","view_paper":"https://pith.science/paper/TWBJ3GJM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.01603&json=true","fetch_graph":"https://pith.science/api/pith-number/TWBJ3GJMYVXWTJX76FJAE76IYI/graph.json","fetch_events":"https://pith.science/api/pith-number/TWBJ3GJMYVXWTJX76FJAE76IYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWBJ3GJMYVXWTJX76FJAE76IYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWBJ3GJMYVXWTJX76FJAE76IYI/action/storage_attestation","attest_author":"https://pith.science/pith/TWBJ3GJMYVXWTJX76FJAE76IYI/action/author_attestation","sign_citation":"https://pith.science/pith/TWBJ3GJMYVXWTJX76FJAE76IYI/action/citation_signature","submit_replication":"https://pith.science/pith/TWBJ3GJMYVXWTJX76FJAE76IYI/action/replication_record"}},"created_at":"2026-05-17T23:48:06.618176+00:00","updated_at":"2026-05-17T23:48:06.618176+00:00"}