{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RPYARZZRE3T7MSL4KPDT26KK4T","short_pith_number":"pith:RPYARZZR","schema_version":"1.0","canonical_sha256":"8bf008e73126e7f6497c53c73d794ae4df08a0667f4ec20dde5e75944e14514f","source":{"kind":"arxiv","id":"1902.08744","version":2},"attestation_state":"computed","paper":{"title":"On Greedy Algorithms for Binary de Bruijn Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Adamas Aqsa Fahreza, Martianus Frederic Ezerman, Zuling Chang","submitted_at":"2019-02-23T06:10:34Z","abstract_excerpt":"We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite (GPO) Algorithm, and its modifications. By identifying specific feedback functions and initial states, we demonstrate that most previously-known greedy algorithms that generate binary de Bruijn sequences are particular cases of our new algorithm."},"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":"1902.08744","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-23T06:10:34Z","cross_cats_sorted":["cs.DS","math.CO","math.IT"],"title_canon_sha256":"622d21a72b3c67ebdce19c8849be15ff0c1beb108ade4d2961f296ebac135b35","abstract_canon_sha256":"557e0d1b89a338a8594b12960af0ef1446117044fb887eb964d68668d38bbebe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:43:25.792951Z","signature_b64":"WX8tU+ewUtctGjm32/kfi14P7iCc6TSTPi8SOgsd9rWNAqXX8wkrni34sgNZiVeZ9JXB44O0E7O5NPxzZEPpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bf008e73126e7f6497c53c73d794ae4df08a0667f4ec20dde5e75944e14514f","last_reissued_at":"2026-07-05T02:43:25.792548Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:43:25.792548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Greedy Algorithms for Binary de Bruijn Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Adamas Aqsa Fahreza, Martianus Frederic Ezerman, Zuling Chang","submitted_at":"2019-02-23T06:10:34Z","abstract_excerpt":"We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite (GPO) Algorithm, and its modifications. By identifying specific feedback functions and initial states, we demonstrate that most previously-known greedy algorithms that generate binary de Bruijn sequences are particular cases of our new algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08744","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1902.08744/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":"1902.08744","created_at":"2026-07-05T02:43:25.792615+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08744v2","created_at":"2026-07-05T02:43:25.792615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08744","created_at":"2026-07-05T02:43:25.792615+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPYARZZRE3T7","created_at":"2026-07-05T02:43:25.792615+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPYARZZRE3T7MSL4","created_at":"2026-07-05T02:43:25.792615+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPYARZZR","created_at":"2026-07-05T02:43:25.792615+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/RPYARZZRE3T7MSL4KPDT26KK4T","json":"https://pith.science/pith/RPYARZZRE3T7MSL4KPDT26KK4T.json","graph_json":"https://pith.science/api/pith-number/RPYARZZRE3T7MSL4KPDT26KK4T/graph.json","events_json":"https://pith.science/api/pith-number/RPYARZZRE3T7MSL4KPDT26KK4T/events.json","paper":"https://pith.science/paper/RPYARZZR"},"agent_actions":{"view_html":"https://pith.science/pith/RPYARZZRE3T7MSL4KPDT26KK4T","download_json":"https://pith.science/pith/RPYARZZRE3T7MSL4KPDT26KK4T.json","view_paper":"https://pith.science/paper/RPYARZZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08744&json=true","fetch_graph":"https://pith.science/api/pith-number/RPYARZZRE3T7MSL4KPDT26KK4T/graph.json","fetch_events":"https://pith.science/api/pith-number/RPYARZZRE3T7MSL4KPDT26KK4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPYARZZRE3T7MSL4KPDT26KK4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPYARZZRE3T7MSL4KPDT26KK4T/action/storage_attestation","attest_author":"https://pith.science/pith/RPYARZZRE3T7MSL4KPDT26KK4T/action/author_attestation","sign_citation":"https://pith.science/pith/RPYARZZRE3T7MSL4KPDT26KK4T/action/citation_signature","submit_replication":"https://pith.science/pith/RPYARZZRE3T7MSL4KPDT26KK4T/action/replication_record"}},"created_at":"2026-07-05T02:43:25.792615+00:00","updated_at":"2026-07-05T02:43:25.792615+00:00"}